./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 a31fd051 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-?-a31fd05 [2023-02-15 13:44:41,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:44:41,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:44:41,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:44:41,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:44:41,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:44:41,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:44:41,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:44:41,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:44:41,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:44:41,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:44:41,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:44:41,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:44:41,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:44:41,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:44:41,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:44:41,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:44:41,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:44:41,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:44:41,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:44:41,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:44:41,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:44:41,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:44:41,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:44:41,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:44:41,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:44:41,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:44:41,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:44:41,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:44:41,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:44:41,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:44:41,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:44:41,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:44:41,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:44:41,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:44:41,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:44:41,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:44:41,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:44:41,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:44:41,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:44:41,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:44:41,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 13:44:41,460 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:44:41,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:44:41,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:44:41,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:44:41,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:44:41,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:44:41,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:44:41,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:44:41,463 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:44:41,464 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:44:41,464 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:44:41,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:44:41,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:44:41,465 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:44:41,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:44:41,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:44:41,466 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:44:41,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:44:41,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:44:41,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:44:41,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:44:41,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:41,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:44:41,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:44:41,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:44:41,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:44:41,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:44:41,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:44:41,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:44:41,469 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:44:41,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:44:41,470 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:44:41,470 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 13:44:41,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:44:41,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:44:41,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:44:41,809 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:44:41,809 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:44:41,810 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 13:44:43,035 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:44:43,273 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:44:43,274 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 13:44:43,283 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38134a6f7/0b00c9ec894c445e8a1180696d925e3c/FLAG2d4cab30d [2023-02-15 13:44:43,299 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38134a6f7/0b00c9ec894c445e8a1180696d925e3c [2023-02-15 13:44:43,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:44:43,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:44:43,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:43,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:44:43,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:44:43,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154bbcff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43, skipping insertion in model container [2023-02-15 13:44:43,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:44:43,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:44:43,503 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 13:44:43,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:43,588 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:44:43,599 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 13:44:43,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:43,631 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:44:43,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43 WrapperNode [2023-02-15 13:44:43,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:43,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:43,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:44:43,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:44:43,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,686 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-15 13:44:43,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:43,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:44:43,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:44:43,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:44:43,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,742 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:44:43,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:44:43,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:44:43,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:44:43,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (1/1) ... [2023-02-15 13:44:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:43,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:43,794 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 13:44:43,817 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 13:44:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:44:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:44:43,836 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:44:43,840 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:44:43,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:44:43,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:44:43,841 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 13:44:43,841 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 13:44:43,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:44:43,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:44:43,909 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:44:43,911 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:44:44,294 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:44:44,305 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:44:44,308 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:44:44,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:44 BoogieIcfgContainer [2023-02-15 13:44:44,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:44:44,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:44:44,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:44:44,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:44:44,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:44:43" (1/3) ... [2023-02-15 13:44:44,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5ae850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:44, skipping insertion in model container [2023-02-15 13:44:44,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:43" (2/3) ... [2023-02-15 13:44:44,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5ae850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:44, skipping insertion in model container [2023-02-15 13:44:44,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:44" (3/3) ... [2023-02-15 13:44:44,319 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2023-02-15 13:44:44,334 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:44:44,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:44:44,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:44:44,401 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;@564b9529, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:44:44,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:44:44,405 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 13:44:44,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:44:44,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:44,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:44,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1249151899, now seen corresponding path program 1 times [2023-02-15 13:44:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:44,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178307438] [2023-02-15 13:44:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,647 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 13:44:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:44,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178307438] [2023-02-15 13:44:44,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178307438] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:44,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:44,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:44,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208407681] [2023-02-15 13:44:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:44,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:44,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:44,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:44,692 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 13:44:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:44,816 INFO L93 Difference]: Finished difference Result 257 states and 374 transitions. [2023-02-15 13:44:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:44,818 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 13:44:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:44,827 INFO L225 Difference]: With dead ends: 257 [2023-02-15 13:44:44,827 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 13:44:44,832 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 13:44:44,835 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:44,836 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.1s Time] [2023-02-15 13:44:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 13:44:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2023-02-15 13:44:44,882 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 13:44:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2023-02-15 13:44:44,887 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 9 [2023-02-15 13:44:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:44,888 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2023-02-15 13:44:44,888 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 13:44:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2023-02-15 13:44:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:44:44,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:44,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:44,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:44:44,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1533700389, now seen corresponding path program 1 times [2023-02-15 13:44:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543558413] [2023-02-15 13:44:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,977 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 13:44:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543558413] [2023-02-15 13:44:44,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543558413] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:44,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:44,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082800210] [2023-02-15 13:44:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:44,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:44,986 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 13:44:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,132 INFO L93 Difference]: Finished difference Result 257 states and 337 transitions. [2023-02-15 13:44:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:45,132 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 13:44:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,135 INFO L225 Difference]: With dead ends: 257 [2023-02-15 13:44:45,135 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 13:44:45,136 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 13:44:45,137 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 128 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:44:45,138 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 13:44:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 13:44:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2023-02-15 13:44:45,152 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 13:44:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2023-02-15 13:44:45,155 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 14 [2023-02-15 13:44:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,155 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2023-02-15 13:44:45,156 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 13:44:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2023-02-15 13:44:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:44:45,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:44:45,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1326976838, now seen corresponding path program 1 times [2023-02-15 13:44:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602928260] [2023-02-15 13:44:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,259 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 13:44:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602928260] [2023-02-15 13:44:45,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602928260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:45,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:45,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:44:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964935269] [2023-02-15 13:44:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:44:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:44:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:44:45,275 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 13:44:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,337 INFO L93 Difference]: Finished difference Result 149 states and 200 transitions. [2023-02-15 13:44:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:44:45,337 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 13:44:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,339 INFO L225 Difference]: With dead ends: 149 [2023-02-15 13:44:45,340 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 13:44:45,340 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 13:44:45,342 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 13:44:45,342 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 13:44:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 13:44:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2023-02-15 13:44:45,355 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 13:44:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2023-02-15 13:44:45,357 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 16 [2023-02-15 13:44:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,358 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2023-02-15 13:44:45,358 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 13:44:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2023-02-15 13:44:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:44:45,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:45,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:44:45,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,360 INFO L85 PathProgramCache]: Analyzing trace with hash 300071915, now seen corresponding path program 1 times [2023-02-15 13:44:45,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659747866] [2023-02-15 13:44:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,421 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 13:44:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659747866] [2023-02-15 13:44:45,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659747866] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:45,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:45,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172041184] [2023-02-15 13:44:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:45,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:45,425 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 13:44:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,500 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2023-02-15 13:44:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:45,501 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 13:44:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,502 INFO L225 Difference]: With dead ends: 167 [2023-02-15 13:44:45,503 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:44:45,503 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 13:44:45,504 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:45,505 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.1s Time] [2023-02-15 13:44:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:44:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-15 13:44:45,517 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 13:44:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2023-02-15 13:44:45,519 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 15 [2023-02-15 13:44:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,519 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2023-02-15 13:44:45,519 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 13:44:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2023-02-15 13:44:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:45,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,521 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:45,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:44:45,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:45,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1842018395, now seen corresponding path program 1 times [2023-02-15 13:44:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805919405] [2023-02-15 13:44:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,582 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 13:44:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805919405] [2023-02-15 13:44:45,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805919405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:45,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:45,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295990778] [2023-02-15 13:44:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:45,585 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 13:44:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,661 INFO L93 Difference]: Finished difference Result 199 states and 264 transitions. [2023-02-15 13:44:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:45,661 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 13:44:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,663 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:44:45,663 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:44:45,664 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 13:44:45,665 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:45,666 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.1s Time] [2023-02-15 13:44:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:44:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2023-02-15 13:44:45,677 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 13:44:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2023-02-15 13:44:45,678 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 17 [2023-02-15 13:44:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,679 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2023-02-15 13:44:45,679 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 13:44:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2023-02-15 13:44:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:45,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,680 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:45,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:44:45,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1813391039, now seen corresponding path program 1 times [2023-02-15 13:44:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790976036] [2023-02-15 13:44:45,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,736 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 13:44:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790976036] [2023-02-15 13:44:45,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790976036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:45,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:45,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461757833] [2023-02-15 13:44:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:45,740 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 13:44:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,803 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2023-02-15 13:44:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:45,804 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 13:44:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,805 INFO L225 Difference]: With dead ends: 197 [2023-02-15 13:44:45,806 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 13:44:45,806 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 13:44:45,807 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 13:44:45,807 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 13:44:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 13:44:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2023-02-15 13:44:45,817 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 13:44:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2023-02-15 13:44:45,818 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 17 [2023-02-15 13:44:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,818 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2023-02-15 13:44:45,818 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 13:44:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2023-02-15 13:44:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:45,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:45,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:44:45,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash -205908396, now seen corresponding path program 1 times [2023-02-15 13:44:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653561344] [2023-02-15 13:44:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,878 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 13:44:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653561344] [2023-02-15 13:44:45,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653561344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:45,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168802600] [2023-02-15 13:44:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:45,883 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 13:44:45,883 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 13:44:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:44:45,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:46,029 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 13:44:46,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:46,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168802600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:46,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:46,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 13:44:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239487729] [2023-02-15 13:44:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:46,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:46,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:46,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:44:46,031 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 13:44:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:46,089 INFO L93 Difference]: Finished difference Result 213 states and 286 transitions. [2023-02-15 13:44:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:46,100 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 13:44:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:46,101 INFO L225 Difference]: With dead ends: 213 [2023-02-15 13:44:46,101 INFO L226 Difference]: Without dead ends: 212 [2023-02-15 13:44:46,102 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 13:44:46,103 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 13:44:46,103 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 13:44:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-15 13:44:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 168. [2023-02-15 13:44:46,112 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 13:44:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions. [2023-02-15 13:44:46,113 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 17 [2023-02-15 13:44:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:46,114 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions. [2023-02-15 13:44:46,114 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 13:44:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions. [2023-02-15 13:44:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:44:46,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:46,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:46,124 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 13:44:46,321 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 13:44:46,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1468255891, now seen corresponding path program 1 times [2023-02-15 13:44:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:46,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121309789] [2023-02-15 13:44:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,353 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 13:44:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:46,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121309789] [2023-02-15 13:44:46,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121309789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:46,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:46,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854348297] [2023-02-15 13:44:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:46,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:46,356 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 13:44:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:46,415 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2023-02-15 13:44:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:46,415 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 13:44:46,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:46,417 INFO L225 Difference]: With dead ends: 214 [2023-02-15 13:44:46,418 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 13:44:46,418 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 13:44:46,420 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 13:44:46,423 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 13:44:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 13:44:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2023-02-15 13:44:46,437 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 13:44:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 225 transitions. [2023-02-15 13:44:46,438 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 225 transitions. Word has length 19 [2023-02-15 13:44:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:46,438 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 225 transitions. [2023-02-15 13:44:46,439 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 13:44:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 225 transitions. [2023-02-15 13:44:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:46,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:46,445 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 13:44:46,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:44:46,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2043615112, now seen corresponding path program 1 times [2023-02-15 13:44:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:46,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959234981] [2023-02-15 13:44:46,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,503 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 13:44:46,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:46,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959234981] [2023-02-15 13:44:46,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959234981] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:46,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:46,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279406149] [2023-02-15 13:44:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:46,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:46,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:46,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:46,505 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 13:44:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:46,582 INFO L93 Difference]: Finished difference Result 192 states and 256 transitions. [2023-02-15 13:44:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:46,583 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 13:44:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:46,586 INFO L225 Difference]: With dead ends: 192 [2023-02-15 13:44:46,586 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 13:44:46,586 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 13:44:46,589 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:46,590 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.1s Time] [2023-02-15 13:44:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 13:44:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2023-02-15 13:44:46,603 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 13:44:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2023-02-15 13:44:46,604 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 24 [2023-02-15 13:44:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:46,605 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2023-02-15 13:44:46,605 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 13:44:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2023-02-15 13:44:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:46,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:46,607 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 13:44:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:44:46,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2072242468, now seen corresponding path program 1 times [2023-02-15 13:44:46,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:46,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220285056] [2023-02-15 13:44:46,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,683 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 13:44:46,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220285056] [2023-02-15 13:44:46,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220285056] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:46,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:46,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975725092] [2023-02-15 13:44:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:46,689 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 13:44:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:46,757 INFO L93 Difference]: Finished difference Result 184 states and 244 transitions. [2023-02-15 13:44:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:46,758 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 13:44:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:46,759 INFO L225 Difference]: With dead ends: 184 [2023-02-15 13:44:46,759 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:44:46,760 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 13:44:46,761 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 13:44:46,761 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 13:44:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:44:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2023-02-15 13:44:46,773 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 13:44:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 204 transitions. [2023-02-15 13:44:46,774 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 204 transitions. Word has length 24 [2023-02-15 13:44:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:46,774 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 204 transitions. [2023-02-15 13:44:46,775 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 13:44:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 204 transitions. [2023-02-15 13:44:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:44:46,776 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:46,777 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 13:44:46,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:44:46,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 333453524, now seen corresponding path program 1 times [2023-02-15 13:44:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:46,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649904569] [2023-02-15 13:44:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,957 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 13:44:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:46,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649904569] [2023-02-15 13:44:46,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649904569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:46,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885957480] [2023-02-15 13:44:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:46,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:46,966 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 13:44:46,989 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 13:44:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:44:47,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:47,106 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 13:44:47,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:47,269 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 13:44:47,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885957480] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:47,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:47,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2023-02-15 13:44:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588006228] [2023-02-15 13:44:47,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:47,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:44:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:44:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:44:47,273 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 13:44:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:47,691 INFO L93 Difference]: Finished difference Result 443 states and 585 transitions. [2023-02-15 13:44:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:44:47,692 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 13:44:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:47,694 INFO L225 Difference]: With dead ends: 443 [2023-02-15 13:44:47,694 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 13:44:47,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:44:47,698 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:47,698 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.3s Time] [2023-02-15 13:44:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 13:44:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 134. [2023-02-15 13:44:47,709 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 13:44:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2023-02-15 13:44:47,710 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 30 [2023-02-15 13:44:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:47,711 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2023-02-15 13:44:47,711 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 13:44:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2023-02-15 13:44:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:44:47,713 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:47,714 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 13:44:47,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:44:47,918 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 13:44:47,918 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1702901583, now seen corresponding path program 1 times [2023-02-15 13:44:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:47,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112498280] [2023-02-15 13:44:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,015 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 13:44:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112498280] [2023-02-15 13:44:48,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112498280] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:48,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:48,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780492580] [2023-02-15 13:44:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:48,018 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 13:44:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:48,129 INFO L93 Difference]: Finished difference Result 325 states and 416 transitions. [2023-02-15 13:44:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:48,129 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 13:44:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:48,130 INFO L225 Difference]: With dead ends: 325 [2023-02-15 13:44:48,131 INFO L226 Difference]: Without dead ends: 262 [2023-02-15 13:44:48,131 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 13:44:48,132 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 180 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:44:48,132 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 13:44:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-15 13:44:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 145. [2023-02-15 13:44:48,140 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 13:44:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2023-02-15 13:44:48,141 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 35 [2023-02-15 13:44:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:48,141 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2023-02-15 13:44:48,142 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 13:44:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2023-02-15 13:44:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:48,142 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:48,143 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 13:44:48,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:44:48,143 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:48,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1201405093, now seen corresponding path program 1 times [2023-02-15 13:44:48,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:48,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219352558] [2023-02-15 13:44:48,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:48,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,250 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 13:44:48,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:48,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219352558] [2023-02-15 13:44:48,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219352558] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:48,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627479534] [2023-02-15 13:44:48,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:48,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:48,252 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 13:44:48,254 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 13:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:44:48,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:48,394 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 13:44:48,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:48,538 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 13:44:48,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627479534] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:48,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:48,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-02-15 13:44:48,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405890675] [2023-02-15 13:44:48,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:48,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:44:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:44:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:44:48,540 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 13:44:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:48,734 INFO L93 Difference]: Finished difference Result 317 states and 405 transitions. [2023-02-15 13:44:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:48,734 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 13:44:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:48,736 INFO L225 Difference]: With dead ends: 317 [2023-02-15 13:44:48,736 INFO L226 Difference]: Without dead ends: 239 [2023-02-15 13:44:48,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:44:48,737 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 13:44:48,737 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 13:44:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-15 13:44:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 132. [2023-02-15 13:44:48,745 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 13:44:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2023-02-15 13:44:48,746 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 39 [2023-02-15 13:44:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:48,746 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2023-02-15 13:44:48,746 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 13:44:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2023-02-15 13:44:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:48,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:48,747 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 13:44:48,755 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 13:44:48,953 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 13:44:48,953 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1429626432, now seen corresponding path program 2 times [2023-02-15 13:44:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770586190] [2023-02-15 13:44:48,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,050 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 13:44:49,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:49,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770586190] [2023-02-15 13:44:49,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770586190] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:49,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:49,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285107314] [2023-02-15 13:44:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:49,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:49,053 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 13:44:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:49,183 INFO L93 Difference]: Finished difference Result 301 states and 384 transitions. [2023-02-15 13:44:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:44:49,184 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 13:44:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:49,186 INFO L225 Difference]: With dead ends: 301 [2023-02-15 13:44:49,186 INFO L226 Difference]: Without dead ends: 242 [2023-02-15 13:44:49,186 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 13:44:49,187 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 13:44:49,187 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 13:44:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-15 13:44:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2023-02-15 13:44:49,199 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 13:44:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 255 transitions. [2023-02-15 13:44:49,200 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 255 transitions. Word has length 39 [2023-02-15 13:44:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:49,200 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 255 transitions. [2023-02-15 13:44:49,200 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 13:44:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2023-02-15 13:44:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:49,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:49,202 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 13:44:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:44:49,202 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1429624510, now seen corresponding path program 1 times [2023-02-15 13:44:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:49,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302092711] [2023-02-15 13:44:49,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,389 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 13:44:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:49,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302092711] [2023-02-15 13:44:49,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302092711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:49,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:49,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:44:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89686899] [2023-02-15 13:44:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:49,392 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 13:44:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:49,582 INFO L93 Difference]: Finished difference Result 389 states and 496 transitions. [2023-02-15 13:44:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:49,583 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 13:44:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:49,584 INFO L225 Difference]: With dead ends: 389 [2023-02-15 13:44:49,584 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 13:44:49,586 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 13:44:49,586 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 13:44:49,586 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 13:44:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 13:44:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 193. [2023-02-15 13:44:49,596 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 13:44:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 253 transitions. [2023-02-15 13:44:49,598 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 253 transitions. Word has length 39 [2023-02-15 13:44:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:49,599 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 253 transitions. [2023-02-15 13:44:49,599 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 13:44:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 253 transitions. [2023-02-15 13:44:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:49,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:49,600 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 13:44:49,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:44:49,600 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1372366208, now seen corresponding path program 1 times [2023-02-15 13:44:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:49,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031370690] [2023-02-15 13:44:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,745 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 13:44:49,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031370690] [2023-02-15 13:44:49,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031370690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99740316] [2023-02-15 13:44:49,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:49,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:49,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:49,753 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 13:44:49,756 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 13:44:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:44:49,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:49,867 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 13:44:49,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:50,072 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 13:44:50,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99740316] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:50,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:50,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-02-15 13:44:50,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917275917] [2023-02-15 13:44:50,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:50,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:44:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:44:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:44:50,075 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 13:44:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:50,283 INFO L93 Difference]: Finished difference Result 494 states and 664 transitions. [2023-02-15 13:44:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:44:50,284 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 13:44:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:50,286 INFO L225 Difference]: With dead ends: 494 [2023-02-15 13:44:50,286 INFO L226 Difference]: Without dead ends: 386 [2023-02-15 13:44:50,287 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 13:44:50,288 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 13:44:50,288 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 13:44:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-15 13:44:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 286. [2023-02-15 13:44:50,301 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 13:44:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 387 transitions. [2023-02-15 13:44:50,303 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 387 transitions. Word has length 39 [2023-02-15 13:44:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:50,303 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 387 transitions. [2023-02-15 13:44:50,304 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 13:44:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 387 transitions. [2023-02-15 13:44:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:44:50,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:50,304 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 13:44:50,321 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 13:44:50,521 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 13:44:50,521 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash -971407210, now seen corresponding path program 1 times [2023-02-15 13:44:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:50,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514683853] [2023-02-15 13:44:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:44:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,649 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 13:44:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:50,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514683853] [2023-02-15 13:44:50,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514683853] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:50,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:50,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530850067] [2023-02-15 13:44:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:50,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:50,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:50,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:50,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:50,652 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 13:44:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:50,817 INFO L93 Difference]: Finished difference Result 626 states and 846 transitions. [2023-02-15 13:44:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:44:50,818 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 13:44:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:50,820 INFO L225 Difference]: With dead ends: 626 [2023-02-15 13:44:50,821 INFO L226 Difference]: Without dead ends: 556 [2023-02-15 13:44:50,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:50,822 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 13:44:50,822 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 13:44:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-02-15 13:44:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 324. [2023-02-15 13:44:50,842 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 13:44:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 440 transitions. [2023-02-15 13:44:50,844 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 440 transitions. Word has length 43 [2023-02-15 13:44:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:50,844 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 440 transitions. [2023-02-15 13:44:50,845 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 13:44:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 440 transitions. [2023-02-15 13:44:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:44:50,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:50,846 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 13:44:50,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:44:50,846 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:50,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash -611040113, now seen corresponding path program 1 times [2023-02-15 13:44:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:50,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629070670] [2023-02-15 13:44:50,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:44:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:51,076 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 13:44:51,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:51,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629070670] [2023-02-15 13:44:51,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629070670] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:51,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301160313] [2023-02-15 13:44:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:51,078 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 13:44:51,087 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 13:44:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:51,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 13:44:51,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:51,362 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 13:44:51,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:51,903 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 13:44:51,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301160313] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:51,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:51,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-15 13:44:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245381195] [2023-02-15 13:44:51,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:51,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:44:51,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:51,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:44:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:44:51,906 INFO L87 Difference]: Start difference. First operand 324 states and 440 transitions. Second operand has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 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 13:44:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:53,171 INFO L93 Difference]: Finished difference Result 998 states and 1345 transitions. [2023-02-15 13:44:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:44:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 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 44 [2023-02-15 13:44:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:53,176 INFO L225 Difference]: With dead ends: 998 [2023-02-15 13:44:53,176 INFO L226 Difference]: Without dead ends: 903 [2023-02-15 13:44:53,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 13:44:53,178 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 586 mSDsluCounter, 4077 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:53,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 4359 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 13:44:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2023-02-15 13:44:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 444. [2023-02-15 13:44:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 393 states have (on average 1.4147582697201018) internal successors, (556), 404 states have internal predecessors, (556), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2023-02-15 13:44:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 618 transitions. [2023-02-15 13:44:53,217 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 618 transitions. Word has length 44 [2023-02-15 13:44:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:53,217 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 618 transitions. [2023-02-15 13:44:53,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 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 13:44:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 618 transitions. [2023-02-15 13:44:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:44:53,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:53,219 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] [2023-02-15 13:44:53,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:44:53,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 13:44:53,425 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1428034485, now seen corresponding path program 1 times [2023-02-15 13:44:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772066780] [2023-02-15 13:44:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 13:44:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,511 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 13:44:53,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:53,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772066780] [2023-02-15 13:44:53,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772066780] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:53,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417079050] [2023-02-15 13:44:53,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:53,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:53,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:53,514 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 13:44:53,516 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 13:44:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:44:53,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:44:53,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:53,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417079050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:53,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:53,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-15 13:44:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935891602] [2023-02-15 13:44:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:53,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:53,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:53,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:53,592 INFO L87 Difference]: Start difference. First operand 444 states and 618 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), 2 states have call successors, (3) [2023-02-15 13:44:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:53,648 INFO L93 Difference]: Finished difference Result 765 states and 1063 transitions. [2023-02-15 13:44:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:53,648 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), 2 states have call successors, (3) Word has length 45 [2023-02-15 13:44:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:53,650 INFO L225 Difference]: With dead ends: 765 [2023-02-15 13:44:53,651 INFO L226 Difference]: Without dead ends: 468 [2023-02-15 13:44:53,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 1 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 13:44:53,652 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 331 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 13:44:53,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 331 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-02-15 13:44:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 456. [2023-02-15 13:44:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 405 states have (on average 1.4024691358024692) internal successors, (568), 416 states have internal predecessors, (568), 28 states have call successors, (28), 12 states have call predecessors, (28), 15 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2023-02-15 13:44:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 630 transitions. [2023-02-15 13:44:53,683 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 630 transitions. Word has length 45 [2023-02-15 13:44:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 630 transitions. [2023-02-15 13:44:53,684 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), 2 states have call successors, (3) [2023-02-15 13:44:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 630 transitions. [2023-02-15 13:44:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:44:53,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:53,685 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] [2023-02-15 13:44:53,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:44:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:53,891 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1873653003, now seen corresponding path program 1 times [2023-02-15 13:44:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808150637] [2023-02-15 13:44:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:44:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:44:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808150637] [2023-02-15 13:44:54,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808150637] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:54,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055603334] [2023-02-15 13:44:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:54,239 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 13:44:54,241 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 13:44:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 13:44:54,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 13:44:54,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:55,253 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 13:44:55,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055603334] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:55,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:55,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2023-02-15 13:44:55,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633899528] [2023-02-15 13:44:55,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:55,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:44:55,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:55,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:44:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1601, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 13:44:55,256 INFO L87 Difference]: Start difference. First operand 456 states and 630 transitions. Second operand has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 13:44:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:57,671 INFO L93 Difference]: Finished difference Result 1221 states and 1739 transitions. [2023-02-15 13:44:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 13:44:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-02-15 13:44:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:57,676 INFO L225 Difference]: With dead ends: 1221 [2023-02-15 13:44:57,677 INFO L226 Difference]: Without dead ends: 1080 [2023-02-15 13:44:57,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=395, Invalid=5007, Unknown=0, NotChecked=0, Total=5402 [2023-02-15 13:44:57,680 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 607 mSDsluCounter, 5243 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 5480 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:57,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 5480 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:44:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-02-15 13:44:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 460. [2023-02-15 13:44:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 407 states have (on average 1.4004914004914004) internal successors, (570), 419 states have internal predecessors, (570), 29 states have call successors, (29), 12 states have call predecessors, (29), 16 states have return successors, (38), 28 states have call predecessors, (38), 27 states have call successors, (38) [2023-02-15 13:44:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 637 transitions. [2023-02-15 13:44:57,725 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 637 transitions. Word has length 46 [2023-02-15 13:44:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:57,725 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 637 transitions. [2023-02-15 13:44:57,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 13:44:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 637 transitions. [2023-02-15 13:44:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:44:57,726 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:57,726 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] [2023-02-15 13:44:57,733 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 13:44:57,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:57,933 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1733104393, now seen corresponding path program 1 times [2023-02-15 13:44:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:57,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423537098] [2023-02-15 13:44:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:44:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,147 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 13:44:58,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:58,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423537098] [2023-02-15 13:44:58,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423537098] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:58,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:58,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:58,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655022861] [2023-02-15 13:44:58,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:58,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:44:58,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:58,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:44:58,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:44:58,150 INFO L87 Difference]: Start difference. First operand 460 states and 637 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 13:44:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:59,180 INFO L93 Difference]: Finished difference Result 585 states and 797 transitions. [2023-02-15 13:44:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:59,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 46 [2023-02-15 13:44:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:59,183 INFO L225 Difference]: With dead ends: 585 [2023-02-15 13:44:59,184 INFO L226 Difference]: Without dead ends: 584 [2023-02-15 13:44:59,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:59,185 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 320 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:59,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1051 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:44:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-02-15 13:44:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 458. [2023-02-15 13:44:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 405 states have (on average 1.4) internal successors, (567), 417 states have internal predecessors, (567), 29 states have call successors, (29), 12 states have call predecessors, (29), 16 states have return successors, (38), 28 states have call predecessors, (38), 27 states have call successors, (38) [2023-02-15 13:44:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 634 transitions. [2023-02-15 13:44:59,217 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 634 transitions. Word has length 46 [2023-02-15 13:44:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:59,218 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 634 transitions. [2023-02-15 13:44:59,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 13:44:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 634 transitions. [2023-02-15 13:44:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:44:59,219 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:59,219 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 13:44:59,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:44:59,220 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 43110630, now seen corresponding path program 1 times [2023-02-15 13:44:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934799425] [2023-02-15 13:44:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:44:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,317 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 13:44:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:59,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934799425] [2023-02-15 13:44:59,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934799425] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:59,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611183582] [2023-02-15 13:44:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:59,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:59,321 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 13:44:59,345 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 13:44:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:44:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:59,415 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 13:44:59,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:59,513 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 13:44:59,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611183582] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:59,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:59,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 13:44:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837541997] [2023-02-15 13:44:59,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:59,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:44:59,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:59,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:44:59,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:59,515 INFO L87 Difference]: Start difference. First operand 458 states and 634 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 13:44:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:59,667 INFO L93 Difference]: Finished difference Result 665 states and 908 transitions. [2023-02-15 13:44:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:44:59,669 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 13:44:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:59,671 INFO L225 Difference]: With dead ends: 665 [2023-02-15 13:44:59,671 INFO L226 Difference]: Without dead ends: 588 [2023-02-15 13:44:59,672 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 13:44:59,672 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 318 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:59,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1315 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-02-15 13:44:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 488. [2023-02-15 13:44:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 432 states have (on average 1.3935185185185186) internal successors, (602), 442 states have internal predecessors, (602), 32 states have call successors, (32), 14 states have call predecessors, (32), 16 states have return successors, (39), 31 states have call predecessors, (39), 28 states have call successors, (39) [2023-02-15 13:44:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 673 transitions. [2023-02-15 13:44:59,706 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 673 transitions. Word has length 49 [2023-02-15 13:44:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:59,707 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 673 transitions. [2023-02-15 13:44:59,707 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 13:44:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 673 transitions. [2023-02-15 13:44:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:44:59,708 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:59,708 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 13:44:59,719 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 13:44:59,914 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,SelfDestructingSolverStorable21 [2023-02-15 13:44:59,915 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:59,915 INFO L85 PathProgramCache]: Analyzing trace with hash 43112552, now seen corresponding path program 1 times [2023-02-15 13:44:59,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:59,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454142138] [2023-02-15 13:44:59,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:45:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:45:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,043 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 13:45:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:00,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454142138] [2023-02-15 13:45:00,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454142138] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:00,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786776100] [2023-02-15 13:45:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:00,046 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 13:45:00,070 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 13:45:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:00,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:00,162 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 13:45:00,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:00,222 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 13:45:00,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786776100] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:00,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:00,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 14 [2023-02-15 13:45:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595666657] [2023-02-15 13:45:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:00,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:45:00,223 INFO L87 Difference]: Start difference. First operand 488 states and 673 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 13:45:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:00,272 INFO L93 Difference]: Finished difference Result 671 states and 926 transitions. [2023-02-15 13:45:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:00,273 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 13:45:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:00,275 INFO L225 Difference]: With dead ends: 671 [2023-02-15 13:45:00,275 INFO L226 Difference]: Without dead ends: 473 [2023-02-15 13:45:00,276 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 13:45:00,276 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 13:45:00,277 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 13:45:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-15 13:45:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 463. [2023-02-15 13:45:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 413 states have (on average 1.3922518159806296) internal successors, (575), 424 states have internal predecessors, (575), 28 states have call successors, (28), 11 states have call predecessors, (28), 14 states have return successors, (33), 27 states have call predecessors, (33), 26 states have call successors, (33) [2023-02-15 13:45:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 636 transitions. [2023-02-15 13:45:00,314 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 636 transitions. Word has length 49 [2023-02-15 13:45:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:00,314 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 636 transitions. [2023-02-15 13:45:00,314 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 13:45:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 636 transitions. [2023-02-15 13:45:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:45:00,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:00,315 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 13:45:00,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:00,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:00,521 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:00,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1531983424, now seen corresponding path program 1 times [2023-02-15 13:45:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:00,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796653475] [2023-02-15 13:45:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,758 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 13:45:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796653475] [2023-02-15 13:45:00,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796653475] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:00,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:00,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:45:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197689861] [2023-02-15 13:45:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:00,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:45:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:45:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:45:00,760 INFO L87 Difference]: Start difference. First operand 463 states and 636 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 13:45:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:01,300 INFO L93 Difference]: Finished difference Result 1232 states and 1748 transitions. [2023-02-15 13:45:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:45:01,300 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 13:45:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:01,304 INFO L225 Difference]: With dead ends: 1232 [2023-02-15 13:45:01,304 INFO L226 Difference]: Without dead ends: 1230 [2023-02-15 13:45:01,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:45:01,305 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 275 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:01,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 3174 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:45:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-02-15 13:45:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 636. [2023-02-15 13:45:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 573 states have (on average 1.411867364746946) internal successors, (809), 585 states have internal predecessors, (809), 37 states have call successors, (37), 14 states have call predecessors, (37), 18 states have return successors, (46), 36 states have call predecessors, (46), 35 states have call successors, (46) [2023-02-15 13:45:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 892 transitions. [2023-02-15 13:45:01,348 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 892 transitions. Word has length 49 [2023-02-15 13:45:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:01,348 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 892 transitions. [2023-02-15 13:45:01,348 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 13:45:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 892 transitions. [2023-02-15 13:45:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:45:01,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:01,349 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 13:45:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:45:01,350 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 823690804, now seen corresponding path program 1 times [2023-02-15 13:45:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837049399] [2023-02-15 13:45:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:45:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:45:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,496 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 13:45:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:01,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837049399] [2023-02-15 13:45:01,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837049399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:01,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41947544] [2023-02-15 13:45:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:01,498 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:45:01,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:45:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:45:01,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:01,648 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 13:45:01,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:01,727 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 13:45:01,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41947544] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:01,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:01,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-02-15 13:45:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811994530] [2023-02-15 13:45:01,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:45:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:01,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:45:01,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:45:01,729 INFO L87 Difference]: Start difference. First operand 636 states and 892 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 13:45:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:02,625 INFO L93 Difference]: Finished difference Result 1813 states and 2577 transitions. [2023-02-15 13:45:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:45:02,626 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 13:45:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:02,631 INFO L225 Difference]: With dead ends: 1813 [2023-02-15 13:45:02,632 INFO L226 Difference]: Without dead ends: 1585 [2023-02-15 13:45:02,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:45:02,634 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 697 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:02,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3771 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:45:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2023-02-15 13:45:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 635. [2023-02-15 13:45:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 572 states have (on average 1.4003496503496504) internal successors, (801), 584 states have internal predecessors, (801), 37 states have call successors, (37), 14 states have call predecessors, (37), 18 states have return successors, (46), 36 states have call predecessors, (46), 35 states have call successors, (46) [2023-02-15 13:45:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 884 transitions. [2023-02-15 13:45:02,680 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 884 transitions. Word has length 52 [2023-02-15 13:45:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 884 transitions. [2023-02-15 13:45:02,680 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 13:45:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 884 transitions. [2023-02-15 13:45:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:45:02,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:02,682 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 13:45:02,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:02,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:45:02,888 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1045708328, now seen corresponding path program 1 times [2023-02-15 13:45:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:02,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994593133] [2023-02-15 13:45:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:02,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:45:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,031 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 13:45:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:03,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994593133] [2023-02-15 13:45:03,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994593133] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:03,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:03,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:45:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817521696] [2023-02-15 13:45:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:03,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:03,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:03,035 INFO L87 Difference]: Start difference. First operand 635 states and 884 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 13:45:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:03,144 INFO L93 Difference]: Finished difference Result 822 states and 1130 transitions. [2023-02-15 13:45:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:45:03,145 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 13:45:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:03,148 INFO L225 Difference]: With dead ends: 822 [2023-02-15 13:45:03,148 INFO L226 Difference]: Without dead ends: 718 [2023-02-15 13:45:03,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:03,149 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:03,150 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.1s Time] [2023-02-15 13:45:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-02-15 13:45:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 656. [2023-02-15 13:45:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 591 states have (on average 1.3908629441624365) internal successors, (822), 601 states have internal predecessors, (822), 39 states have call successors, (39), 16 states have call predecessors, (39), 18 states have return successors, (46), 38 states have call predecessors, (46), 35 states have call successors, (46) [2023-02-15 13:45:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 907 transitions. [2023-02-15 13:45:03,188 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 907 transitions. Word has length 52 [2023-02-15 13:45:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:03,189 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 907 transitions. [2023-02-15 13:45:03,189 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 13:45:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 907 transitions. [2023-02-15 13:45:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:45:03,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:03,190 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 13:45:03,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:45:03,190 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1823069785, now seen corresponding path program 1 times [2023-02-15 13:45:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306653693] [2023-02-15 13:45:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,473 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 13:45:03,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306653693] [2023-02-15 13:45:03,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306653693] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300287680] [2023-02-15 13:45:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:03,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:03,476 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:45:03,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:45:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:45:03,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:03,811 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 13:45:03,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:04,314 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 13:45:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300287680] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:04,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:04,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2023-02-15 13:45:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911164376] [2023-02-15 13:45:04,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:04,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:45:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:45:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:45:04,317 INFO L87 Difference]: Start difference. First operand 656 states and 907 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 13:45:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:06,414 INFO L93 Difference]: Finished difference Result 1726 states and 2384 transitions. [2023-02-15 13:45:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 13:45:06,415 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 13:45:06,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:06,426 INFO L225 Difference]: With dead ends: 1726 [2023-02-15 13:45:06,426 INFO L226 Difference]: Without dead ends: 1543 [2023-02-15 13:45:06,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2023-02-15 13:45:06,433 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 874 mSDsluCounter, 6070 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 6473 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:06,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 6473 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 13:45:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2023-02-15 13:45:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 705. [2023-02-15 13:45:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 636 states have (on average 1.3852201257861636) internal successors, (881), 646 states have internal predecessors, (881), 42 states have call successors, (42), 17 states have call predecessors, (42), 19 states have return successors, (49), 41 states have call predecessors, (49), 38 states have call successors, (49) [2023-02-15 13:45:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 972 transitions. [2023-02-15 13:45:06,492 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 972 transitions. Word has length 51 [2023-02-15 13:45:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:06,493 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 972 transitions. [2023-02-15 13:45:06,493 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 13:45:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 972 transitions. [2023-02-15 13:45:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:45:06,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:06,494 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 13:45:06,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:06,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:45:06,701 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash 68846426, now seen corresponding path program 1 times [2023-02-15 13:45:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:06,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859947876] [2023-02-15 13:45:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:06,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:45:06,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:45:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:45:06,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:45:06,769 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:45:06,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 13:45:06,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 13:45:06,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 13:45:06,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 13:45:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 13:45:06,776 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, 1] [2023-02-15 13:45:06,779 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:45:06,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:45:06 BoogieIcfgContainer [2023-02-15 13:45:06,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:45:06,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:45:06,834 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:45:06,834 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:45:06,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:44" (3/4) ... [2023-02-15 13:45:06,837 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:45:06,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:45:06,837 INFO L158 Benchmark]: Toolchain (without parser) took 23534.62ms. Allocated memory was 113.2MB in the beginning and 239.1MB in the end (delta: 125.8MB). Free memory was 68.8MB in the beginning and 94.9MB in the end (delta: -26.2MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,838 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:06,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.77ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 55.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.08ms. Allocated memory is still 113.2MB. Free memory was 55.4MB in the beginning and 53.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,838 INFO L158 Benchmark]: Boogie Preprocessor took 59.37ms. Allocated memory is still 113.2MB. Free memory was 53.7MB in the beginning and 52.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,840 INFO L158 Benchmark]: RCFGBuilder took 563.99ms. Allocated memory was 113.2MB in the beginning and 165.7MB in the end (delta: 52.4MB). Free memory was 52.0MB in the beginning and 124.4MB in the end (delta: -72.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,841 INFO L158 Benchmark]: TraceAbstraction took 22520.49ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 123.5MB in the beginning and 94.9MB in the end (delta: 28.5MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2023-02-15 13:45:06,841 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 239.1MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:06,851 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.20ms. Allocated memory is still 113.2MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.77ms. Allocated memory is still 113.2MB. Free memory was 68.8MB in the beginning and 55.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.08ms. Allocated memory is still 113.2MB. Free memory was 55.4MB in the beginning and 53.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.37ms. Allocated memory is still 113.2MB. Free memory was 53.7MB in the beginning and 52.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.99ms. Allocated memory was 113.2MB in the beginning and 165.7MB in the end (delta: 52.4MB). Free memory was 52.0MB in the beginning and 124.4MB in the end (delta: -72.4MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22520.49ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 123.5MB in the beginning and 94.9MB in the end (delta: 28.5MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 239.1MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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: 22.4s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6665 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6555 mSDsluCounter, 40137 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35693 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8242 IncrementalHoareTripleChecker+Invalid, 8875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 4444 mSDtfsCounter, 8242 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1330 GetRequests, 911 SyntacticMatches, 10 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=27, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 4926 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 6960 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1440 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 47 InterpolantComputations, 19 PerfectInterpolantSequences, 568/692 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 13:45:06,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis 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-?-a31fd05 [2023-02-15 13:45:08,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:45:08,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:45:09,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:45:09,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:45:09,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:45:09,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:45:09,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:45:09,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:45:09,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:45:09,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:45:09,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:45:09,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:45:09,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:45:09,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:45:09,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:45:09,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:45:09,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:45:09,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:45:09,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:45:09,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:45:09,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:45:09,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:45:09,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:45:09,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:45:09,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:45:09,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:45:09,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:45:09,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:45:09,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:45:09,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:45:09,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:45:09,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:45:09,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:45:09,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:45:09,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:45:09,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:45:09,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:45:09,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:45:09,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:45:09,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:45:09,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 13:45:09,123 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:45:09,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:45:09,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:45:09,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:45:09,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:45:09,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:45:09,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:45:09,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:45:09,126 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:45:09,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:45:09,127 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:45:09,127 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:45:09,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:45:09,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:45:09,128 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:45:09,129 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:45:09,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:45:09,129 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:45:09,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:45:09,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:45:09,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:45:09,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:45:09,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:45:09,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:45:09,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:45:09,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:45:09,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:45:09,132 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:45:09,132 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:45:09,132 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 13:45:09,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:45:09,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:45:09,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:45:09,493 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:45:09,493 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:45:09,495 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 13:45:10,697 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:45:10,943 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:45:10,944 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 13:45:10,951 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57646362b/a3ed84fd1e1e4d5f8dc8c8d3cb3b3fcd/FLAG9e64794ef [2023-02-15 13:45:10,973 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57646362b/a3ed84fd1e1e4d5f8dc8c8d3cb3b3fcd [2023-02-15 13:45:10,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:45:10,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:45:10,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:45:10,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:45:10,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:45:10,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:45:10" (1/1) ... [2023-02-15 13:45:10,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690f774b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:10, skipping insertion in model container [2023-02-15 13:45:10,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:45:10" (1/1) ... [2023-02-15 13:45:10,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:45:11,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:45:11,182 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 13:45:11,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:45:11,285 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:45:11,299 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 13:45:11,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:45:11,353 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:45:11,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11 WrapperNode [2023-02-15 13:45:11,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:45:11,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:45:11,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:45:11,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:45:11,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,387 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-02-15 13:45:11,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:45:11,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:45:11,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:45:11,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:45:11,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:45:11,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:45:11,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:45:11,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:45:11,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (1/1) ... [2023-02-15 13:45:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:45:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:11,455 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 13:45:11,469 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 13:45:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:45:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:45:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:45:11,493 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:45:11,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:45:11,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:45:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 13:45:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 13:45:11,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:45:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:45:11,564 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:45:11,566 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:45:11,938 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:45:11,954 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:45:11,954 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:45:11,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:11 BoogieIcfgContainer [2023-02-15 13:45:11,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:45:11,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:45:11,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:45:11,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:45:11,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:45:10" (1/3) ... [2023-02-15 13:45:11,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20614ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:45:11, skipping insertion in model container [2023-02-15 13:45:11,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:11" (2/3) ... [2023-02-15 13:45:11,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20614ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:45:11, skipping insertion in model container [2023-02-15 13:45:11,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:11" (3/3) ... [2023-02-15 13:45:11,967 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2023-02-15 13:45:11,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:45:11,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:45:12,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:45:12,062 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;@56601f02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:45:12,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:45:12,067 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 13:45:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:45:12,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:12,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:12,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 915940719, now seen corresponding path program 1 times [2023-02-15 13:45:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:12,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189111019] [2023-02-15 13:45:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:12,094 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 13:45:12,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:12,098 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 13:45:12,099 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 13:45:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:12,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 13:45:12,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:12,170 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 13:45:12,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:12,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:12,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189111019] [2023-02-15 13:45:12,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189111019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:12,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:12,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:45:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447770217] [2023-02-15 13:45:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:12,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:45:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:45:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:45:12,205 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 13:45:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:12,233 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2023-02-15 13:45:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:45:12,235 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 13:45:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:12,244 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:45:12,245 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 13:45:12,252 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 13:45:12,255 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 13:45:12,257 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 13:45:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 13:45:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-15 13:45:12,298 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 13:45:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-02-15 13:45:12,309 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 9 [2023-02-15 13:45:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:12,309 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-02-15 13:45:12,310 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 13:45:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-02-15 13:45:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:45:12,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:12,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:12,328 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 (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:12,521 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 13:45:12,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 914999453, now seen corresponding path program 1 times [2023-02-15 13:45:12,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258772565] [2023-02-15 13:45:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:12,524 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 13:45:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:12,529 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 13:45:12,541 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 13:45:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:12,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:45:12,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:12,628 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 13:45:12,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:12,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:12,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258772565] [2023-02-15 13:45:12,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258772565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:12,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:12,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:45:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249859125] [2023-02-15 13:45:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:12,633 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 13:45:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:12,682 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2023-02-15 13:45:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:12,683 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 13:45:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:12,685 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:45:12,686 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 13:45:12,687 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 13:45:12,687 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 13:45:12,688 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 13:45:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 13:45:12,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 13:45:12,702 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 13:45:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-02-15 13:45:12,704 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 9 [2023-02-15 13:45:12,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:12,707 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-02-15 13:45:12,707 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 13:45:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-02-15 13:45:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:45:12,708 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:12,708 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:12,716 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 13:45:12,916 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 13:45:12,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash -459560941, now seen corresponding path program 1 times [2023-02-15 13:45:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:12,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594058500] [2023-02-15 13:45:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:12,929 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 13:45:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:12,933 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 13:45:12,935 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 13:45:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:12,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:12,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:12,977 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 13:45:12,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:12,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:12,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594058500] [2023-02-15 13:45:12,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594058500] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:12,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:12,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360013121] [2023-02-15 13:45:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:12,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:12,981 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 13:45:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:13,007 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2023-02-15 13:45:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:13,008 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 13:45:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:13,009 INFO L225 Difference]: With dead ends: 73 [2023-02-15 13:45:13,010 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 13:45:13,010 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 13:45:13,012 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 13:45:13,014 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 13:45:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 13:45:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-15 13:45:13,028 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 13:45:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-02-15 13:45:13,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 16 [2023-02-15 13:45:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:13,032 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-02-15 13:45:13,032 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 13:45:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-02-15 13:45:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:45:13,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:13,033 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 13:45:13,047 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 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:13,241 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 13:45:13,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1631017083, now seen corresponding path program 1 times [2023-02-15 13:45:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:13,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943436155] [2023-02-15 13:45:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:13,244 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 13:45:13,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:13,245 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 13:45:13,248 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 13:45:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:13,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:13,290 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 13:45:13,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:13,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:13,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943436155] [2023-02-15 13:45:13,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943436155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:13,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:13,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127828716] [2023-02-15 13:45:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:13,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:13,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:13,294 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 13:45:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:13,316 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2023-02-15 13:45:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:13,317 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 13:45:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:13,318 INFO L225 Difference]: With dead ends: 72 [2023-02-15 13:45:13,318 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 13:45:13,319 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 13:45:13,320 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 13:45:13,320 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 13:45:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 13:45:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-15 13:45:13,326 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 13:45:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-02-15 13:45:13,327 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 18 [2023-02-15 13:45:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:13,328 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-02-15 13:45:13,328 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 13:45:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-02-15 13:45:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:45:13,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:13,329 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 13:45:13,339 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 (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:13,537 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 13:45:13,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:13,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1631084609, now seen corresponding path program 1 times [2023-02-15 13:45:13,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:13,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130440496] [2023-02-15 13:45:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:13,539 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 13:45:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:13,542 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 13:45:13,544 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 13:45:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:45:13,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:13,630 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 13:45:13,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:13,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:13,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130440496] [2023-02-15 13:45:13,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130440496] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:13,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:13,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:45:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188849193] [2023-02-15 13:45:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:13,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:13,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:13,633 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 13:45:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:13,968 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2023-02-15 13:45:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:13,969 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 13:45:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:13,971 INFO L225 Difference]: With dead ends: 84 [2023-02-15 13:45:13,971 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:45:13,971 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 13:45:13,972 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:13,972 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.3s Time] [2023-02-15 13:45:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:45:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-15 13:45:13,980 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 13:45:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2023-02-15 13:45:13,981 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 18 [2023-02-15 13:45:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:13,981 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2023-02-15 13:45:13,981 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 13:45:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2023-02-15 13:45:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:45:13,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:13,982 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 13:45:13,993 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 13:45:14,190 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 13:45:14,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1776660725, now seen corresponding path program 1 times [2023-02-15 13:45:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:14,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475339723] [2023-02-15 13:45:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:14,192 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 13:45:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:14,205 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 13:45:14,208 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 13:45:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:14,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:45:14,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:14,899 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 13:45:14,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:14,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475339723] [2023-02-15 13:45:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475339723] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:14,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:14,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:45:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113532642] [2023-02-15 13:45:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:14,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:45:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:45:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:45:14,901 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 13:45:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:17,026 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-02-15 13:45:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:45:17,026 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 13:45:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:17,027 INFO L225 Difference]: With dead ends: 89 [2023-02-15 13:45:17,028 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 13:45:17,028 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 13:45:17,029 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 13:45:17,029 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 13:45:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 13:45:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-15 13:45:17,037 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 13:45:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-02-15 13:45:17,038 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 21 [2023-02-15 13:45:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:17,038 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-02-15 13:45:17,038 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 13:45:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-02-15 13:45:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:45:17,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:17,040 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 13:45:17,049 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 13:45:17,248 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 13:45:17,249 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash -595033411, now seen corresponding path program 1 times [2023-02-15 13:45:17,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213585640] [2023-02-15 13:45:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:17,251 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 13:45:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:17,253 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 13:45:17,256 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 13:45:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:17,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:17,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:17,350 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 13:45:17,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:17,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213585640] [2023-02-15 13:45:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213585640] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:17,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:17,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:45:17,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997840960] [2023-02-15 13:45:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:17,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:17,353 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 13:45:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:17,441 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-15 13:45:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:45:17,442 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 13:45:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:17,443 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:45:17,443 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:45:17,444 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 13:45:17,445 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:17,446 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.1s Time] [2023-02-15 13:45:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:45:17,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-15 13:45:17,459 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 13:45:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-15 13:45:17,460 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 37 [2023-02-15 13:45:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:17,460 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-15 13:45:17,460 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 13:45:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-15 13:45:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:45:17,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:17,462 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 13:45:17,476 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 13:45:17,673 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 13:45:17,673 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1830771986, now seen corresponding path program 1 times [2023-02-15 13:45:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:17,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199630765] [2023-02-15 13:45:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:17,675 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 13:45:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:17,679 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 13:45:17,683 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 13:45:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:17,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:17,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:17,818 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 13:45:17,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:17,888 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 13:45:17,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:17,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199630765] [2023-02-15 13:45:17,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199630765] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:17,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:17,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-15 13:45:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886029400] [2023-02-15 13:45:17,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:17,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:17,891 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 13:45:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:18,030 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2023-02-15 13:45:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:18,031 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 13:45:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:18,034 INFO L225 Difference]: With dead ends: 139 [2023-02-15 13:45:18,034 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 13:45:18,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 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 13:45:18,035 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:45:18,036 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 13:45:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 13:45:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-02-15 13:45:18,064 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 13:45:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-02-15 13:45:18,065 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 41 [2023-02-15 13:45:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:18,066 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-02-15 13:45:18,066 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 13:45:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-02-15 13:45:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:45:18,067 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:18,067 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 13:45:18,077 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 13:45:18,273 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 13:45:18,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1559170192, now seen corresponding path program 1 times [2023-02-15 13:45:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:18,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056469748] [2023-02-15 13:45:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:18,274 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 13:45:18,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:18,275 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 13:45:18,276 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 13:45:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:18,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:18,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:18,380 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 13:45:18,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:18,441 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 13:45:18,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056469748] [2023-02-15 13:45:18,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056469748] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:18,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:18,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 13:45:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973052305] [2023-02-15 13:45:18,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:18,443 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 13:45:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:18,526 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2023-02-15 13:45:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:45:18,527 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 13:45:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:18,528 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:45:18,528 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 13:45:18,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 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 13:45:18,529 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:18,529 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.1s Time] [2023-02-15 13:45:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 13:45:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-15 13:45:18,536 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 13:45:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-02-15 13:45:18,537 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 45 [2023-02-15 13:45:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:18,537 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-02-15 13:45:18,537 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 13:45:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-02-15 13:45:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:45:18,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:18,539 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 13:45:18,549 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 13:45:18,747 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 13:45:18,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1965949981, now seen corresponding path program 2 times [2023-02-15 13:45:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:18,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572527178] [2023-02-15 13:45:18,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:45:18,752 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 13:45:18,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:18,754 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 13:45:18,755 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 13:45:18,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:45:18,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:45:18,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:18,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:18,878 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 13:45:18,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:18,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:18,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572527178] [2023-02-15 13:45:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572527178] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:18,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:18,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:45:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355887127] [2023-02-15 13:45:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:18,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:18,880 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 13:45:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:19,164 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2023-02-15 13:45:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:45:19,164 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 13:45:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:19,166 INFO L225 Difference]: With dead ends: 169 [2023-02-15 13:45:19,166 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:45:19,166 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 13:45:19,167 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:19,167 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.2s Time] [2023-02-15 13:45:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:45:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2023-02-15 13:45:19,176 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 13:45:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2023-02-15 13:45:19,177 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 45 [2023-02-15 13:45:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:19,177 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2023-02-15 13:45:19,178 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 13:45:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2023-02-15 13:45:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:19,179 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:19,179 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 13:45:19,191 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 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:19,388 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 13:45:19,388 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash 814907427, now seen corresponding path program 1 times [2023-02-15 13:45:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:19,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818872686] [2023-02-15 13:45:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:19,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:19,390 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 13:45:19,391 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 13:45:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:19,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:45:19,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:19,529 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 13:45:19,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:19,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:19,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818872686] [2023-02-15 13:45:19,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818872686] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:19,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:19,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:45:19,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113241079] [2023-02-15 13:45:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:19,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:19,531 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 13:45:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:19,705 INFO L93 Difference]: Finished difference Result 222 states and 271 transitions. [2023-02-15 13:45:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:19,706 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 13:45:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:19,707 INFO L225 Difference]: With dead ends: 222 [2023-02-15 13:45:19,707 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:45:19,707 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 13:45:19,708 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 13:45:19,708 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 13:45:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:45:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2023-02-15 13:45:19,719 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 13:45:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2023-02-15 13:45:19,720 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 46 [2023-02-15 13:45:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:19,721 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2023-02-15 13:45:19,721 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 13:45:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2023-02-15 13:45:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:19,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:19,722 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 13:45:19,731 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 13:45:19,930 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 13:45:19,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 228101413, now seen corresponding path program 1 times [2023-02-15 13:45:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620613995] [2023-02-15 13:45:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:19,931 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 13:45:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:19,932 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 13:45:19,933 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 13:45:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:19,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:45:19,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:20,121 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 13:45:20,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:20,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:20,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620613995] [2023-02-15 13:45:20,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620613995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:20,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:20,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:45:20,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120984678] [2023-02-15 13:45:20,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:45:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:45:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:45:20,123 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 13:45:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:20,368 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2023-02-15 13:45:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:45:20,369 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 13:45:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:20,369 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:45:20,369 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 13:45:20,381 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 13:45:20,381 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:20,382 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.2s Time] [2023-02-15 13:45:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 13:45:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-02-15 13:45:20,390 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 13:45:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-02-15 13:45:20,391 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 46 [2023-02-15 13:45:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:20,392 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-02-15 13:45:20,392 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 13:45:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-02-15 13:45:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:45:20,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:20,394 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 13:45:20,407 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 13:45:20,603 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 13:45:20,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -740435001, now seen corresponding path program 1 times [2023-02-15 13:45:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993057500] [2023-02-15 13:45:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:20,605 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 13:45:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:20,606 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 13:45:20,609 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 13:45:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:20,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:45:20,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:20,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 13:45:20,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:20,860 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 13:45:20,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:20,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993057500] [2023-02-15 13:45:20,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993057500] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:20,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-02-15 13:45:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260153022] [2023-02-15 13:45:20,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:20,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:45:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:45:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:45:20,861 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 13:45:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:20,942 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2023-02-15 13:45:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:20,943 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 13:45:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:20,943 INFO L225 Difference]: With dead ends: 114 [2023-02-15 13:45:20,944 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:45:20,944 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 13:45:20,944 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 13:45:20,945 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 13:45:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:45:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-02-15 13:45:20,952 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 13:45:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2023-02-15 13:45:20,953 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 47 [2023-02-15 13:45:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:20,953 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2023-02-15 13:45:20,953 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 13:45:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2023-02-15 13:45:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 13:45:20,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:20,954 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 13:45:20,965 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 13:45:21,163 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 13:45:21,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 455638881, now seen corresponding path program 1 times [2023-02-15 13:45:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806183962] [2023-02-15 13:45:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:21,164 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 13:45:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:21,165 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 13:45:21,166 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 13:45:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:21,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:21,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:21,271 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 13:45:21,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:21,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:21,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806183962] [2023-02-15 13:45:21,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806183962] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:21,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:21,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:45:21,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300341121] [2023-02-15 13:45:21,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:21,273 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 13:45:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:21,382 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2023-02-15 13:45:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:21,387 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 13:45:21,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:21,388 INFO L225 Difference]: With dead ends: 153 [2023-02-15 13:45:21,388 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:45:21,388 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 13:45:21,389 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 13:45:21,389 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 13:45:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:45:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-02-15 13:45:21,402 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 13:45:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-02-15 13:45:21,403 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 50 [2023-02-15 13:45:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:21,404 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-02-15 13:45:21,405 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 13:45:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-02-15 13:45:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:45:21,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:21,406 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 13:45:21,417 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 13:45:21,615 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 13:45:21,615 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1478648391, now seen corresponding path program 1 times [2023-02-15 13:45:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:21,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883667905] [2023-02-15 13:45:21,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:21,616 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 13:45:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:21,618 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 13:45:21,620 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 13:45:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:21,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:45:21,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:21,724 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 13:45:21,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:21,858 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 13:45:21,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:21,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883667905] [2023-02-15 13:45:21,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883667905] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:21,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:21,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2023-02-15 13:45:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451372771] [2023-02-15 13:45:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:21,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:21,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:21,859 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 13:45:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:21,971 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2023-02-15 13:45:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:21,971 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 13:45:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:21,972 INFO L225 Difference]: With dead ends: 110 [2023-02-15 13:45:21,972 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:45:21,972 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 13:45:21,973 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 13:45:21,973 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 13:45:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:45:21,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2023-02-15 13:45:21,980 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 13:45:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2023-02-15 13:45:21,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 48 [2023-02-15 13:45:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:21,980 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2023-02-15 13:45:21,980 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 13:45:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2023-02-15 13:45:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 13:45:21,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:21,981 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 13:45:21,993 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 13:45:22,182 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 13:45:22,182 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1628912936, now seen corresponding path program 1 times [2023-02-15 13:45:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:22,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747523112] [2023-02-15 13:45:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:22,183 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 13:45:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:22,184 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 13:45:22,185 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 13:45:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:22,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:45:22,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:22,356 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 13:45:22,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:22,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747523112] [2023-02-15 13:45:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747523112] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1699284269] [2023-02-15 13:45:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:45:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:45:22,505 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 13:45:22,532 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 13:45:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:22,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:22,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:22,600 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 13:45:22,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:22,641 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 13:45:22,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1699284269] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:22,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:22,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 12 [2023-02-15 13:45:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886020585] [2023-02-15 13:45:22,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:45:22,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:45:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:45:22,644 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 13:45:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:22,910 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2023-02-15 13:45:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:22,910 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 13:45:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:22,911 INFO L225 Difference]: With dead ends: 169 [2023-02-15 13:45:22,911 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 13:45:22,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 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 13:45:22,912 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 13:45:22,912 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 13:45:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 13:45:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2023-02-15 13:45:22,922 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 13:45:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2023-02-15 13:45:22,923 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 55 [2023-02-15 13:45:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:22,923 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2023-02-15 13:45:22,924 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 13:45:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2023-02-15 13:45:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:45:22,925 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:22,925 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 13:45:22,935 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 (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:23,135 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 13:45:23,333 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 13:45:23,333 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1769714002, now seen corresponding path program 1 times [2023-02-15 13:45:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644343638] [2023-02-15 13:45:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:23,334 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 13:45:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:23,335 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 13:45:23,337 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 13:45:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:23,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:23,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:23,424 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 13:45:23,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:23,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644343638] [2023-02-15 13:45:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644343638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:23,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:23,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882816953] [2023-02-15 13:45:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:23,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:23,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:23,425 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 13:45:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:23,622 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2023-02-15 13:45:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:23,623 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 13:45:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:23,624 INFO L225 Difference]: With dead ends: 139 [2023-02-15 13:45:23,624 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 13:45:23,624 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 13:45:23,624 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 13:45:23,625 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 13:45:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 13:45:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2023-02-15 13:45:23,634 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 13:45:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2023-02-15 13:45:23,635 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 57 [2023-02-15 13:45:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:23,636 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2023-02-15 13:45:23,636 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 13:45:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2023-02-15 13:45:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 13:45:23,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:23,637 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 13:45:23,649 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 (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:23,846 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 13:45:23,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:23,847 INFO L85 PathProgramCache]: Analyzing trace with hash -657383583, now seen corresponding path program 1 times [2023-02-15 13:45:23,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:23,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102489030] [2023-02-15 13:45:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:23,848 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 13:45:23,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:23,848 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 13:45:23,852 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 13:45:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:23,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:45:23,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:23,959 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 13:45:23,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:24,099 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 13:45:24,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:24,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102489030] [2023-02-15 13:45:24,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102489030] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:24,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:24,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 13:45:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321479551] [2023-02-15 13:45:24,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:24,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:45:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:45:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:45:24,101 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 13:45:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:24,292 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2023-02-15 13:45:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:24,294 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 13:45:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:24,295 INFO L225 Difference]: With dead ends: 177 [2023-02-15 13:45:24,295 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 13:45:24,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 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 13:45:24,296 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 13:45:24,296 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 13:45:24,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 13:45:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2023-02-15 13:45:24,304 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 13:45:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2023-02-15 13:45:24,306 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 63 [2023-02-15 13:45:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:24,306 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2023-02-15 13:45:24,307 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 13:45:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2023-02-15 13:45:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 13:45:24,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:24,312 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 13:45:24,324 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 13:45:24,521 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 13:45:24,522 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash 7672150, now seen corresponding path program 1 times [2023-02-15 13:45:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:24,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074761027] [2023-02-15 13:45:24,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:24,523 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 13:45:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:24,524 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 13:45:24,529 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 13:45:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:24,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:45:24,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:24,635 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 13:45:24,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:24,696 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 13:45:24,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:24,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074761027] [2023-02-15 13:45:24,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074761027] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:24,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:24,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 13:45:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375199687] [2023-02-15 13:45:24,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:24,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:24,698 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 13:45:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:24,856 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2023-02-15 13:45:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:24,857 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 13:45:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:24,858 INFO L225 Difference]: With dead ends: 222 [2023-02-15 13:45:24,858 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 13:45:24,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 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 13:45:24,859 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 13:45:24,859 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 13:45:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 13:45:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2023-02-15 13:45:24,867 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 13:45:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2023-02-15 13:45:24,868 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 71 [2023-02-15 13:45:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2023-02-15 13:45:24,869 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 13:45:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2023-02-15 13:45:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 13:45:24,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:24,870 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 13:45:24,882 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 13:45:25,083 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 13:45:25,083 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:25,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1027892857, now seen corresponding path program 1 times [2023-02-15 13:45:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560446073] [2023-02-15 13:45:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:25,084 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 13:45:25,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:25,086 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 13:45:25,088 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 13:45:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:25,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:45:25,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:25,271 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 13:45:25,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:25,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:25,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560446073] [2023-02-15 13:45:25,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560446073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:25,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:25,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:45:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777897209] [2023-02-15 13:45:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:25,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:25,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:25,272 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 13:45:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:25,681 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2023-02-15 13:45:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:25,682 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 13:45:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:25,682 INFO L225 Difference]: With dead ends: 141 [2023-02-15 13:45:25,682 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 13:45:25,682 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 13:45:25,683 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:25,683 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.4s Time] [2023-02-15 13:45:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 13:45:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 13:45:25,684 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 13:45:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 13:45:25,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-15 13:45:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:25,684 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 13:45:25,684 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 13:45:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 13:45:25,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 13:45:25,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 13:45:25,687 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 13:45:25,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 13:45:25,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 13:45:25,695 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 13:45:25,888 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 13:45:25,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 13:45:29,808 INFO L899 garLoopResultBuilder]: For program point L60(lines 58 73) no Hoare annotation was computed. [2023-02-15 13:45:29,808 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-15 13:45:29,808 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-02-15 13:45:29,808 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:29,808 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 76) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-02-15 13:45:29,809 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:29,809 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-15 13:45:29,809 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 83) the Hoare annotation is: true [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 25 83) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 35) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point L59(lines 58 73) no Hoare annotation was computed. [2023-02-15 13:45:29,810 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-15 13:45:29,811 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 25 83) no Hoare annotation was computed. [2023-02-15 13:45:29,811 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_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (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|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32))) .cse0))) [2023-02-15 13:45:29,811 INFO L899 garLoopResultBuilder]: For program point L39(lines 38 53) no Hoare annotation was computed. [2023-02-15 13:45:29,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 13:45:29,815 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 257) no Hoare annotation was computed. [2023-02-15 13:45:29,815 INFO L902 garLoopResultBuilder]: At program point L246(line 246) the Hoare annotation is: true [2023-02-15 13:45:29,815 INFO L902 garLoopResultBuilder]: At program point L248-2(lines 248 257) the Hoare annotation is: true [2023-02-15 13:45:29,815 INFO L899 garLoopResultBuilder]: For program point L246-1(line 246) no Hoare annotation was computed. [2023-02-15 13:45:29,815 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2023-02-15 13:45:29,815 INFO L899 garLoopResultBuilder]: For program point L244-1(line 244) no Hoare annotation was computed. [2023-02-15 13:45:29,815 INFO L902 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: true [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 13:45:29,816 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 226 264) the Hoare annotation is: true [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point L259(line 259) no Hoare annotation was computed. [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 13:45:29,816 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 255) no Hoare annotation was computed. [2023-02-15 13:45:29,820 INFO L899 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L902 garLoopResultBuilder]: At program point L245(line 245) the Hoare annotation is: true [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point L245-1(line 245) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L902 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: true [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point L243-1(line 243) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point addfltFINAL(lines 84 148) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 138) no Hoare annotation was computed. [2023-02-15 13:45:29,821 INFO L899 garLoopResultBuilder]: For program point addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-15 13:45:29,822 INFO L895 garLoopResultBuilder]: At program point L127-2(lines 127 138) the Hoare annotation is: (let ((.cse2 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse5 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse1 (bvadd (bvneg ((_ sign_extend 1) addflt_~eb~0)) ((_ sign_extend 1) addflt_~ea~0))) (.cse0 (= |addflt_#in~b| (_ bv0 32))) (.cse4 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse3 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (not .cse0) (or (and (bvsle .cse1 (_ bv2147483647 33)) (= addflt_~ea~0 (_ bv127 32)) .cse2) .cse3) (or .cse4 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) .cse2 (= addflt_~b |addflt_#in~b|) .cse5)) (let ((.cse6 (or .cse0 (not (= addflt_~b (_ bv0 32))))) (.cse7 (bvsle (_ bv6442450944 33) .cse1))) (or (and .cse6 .cse7 .cse5) (and (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32)))) .cse6 .cse7))) (not (= |addflt_#in~a| (_ bv0 32))) (or .cse4 .cse3 (= addflt_~eb~0 (_ bv127 32))))) [2023-02-15 13:45:29,822 INFO L899 garLoopResultBuilder]: For program point addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-15 13:45:29,822 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse1 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse0 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse2 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) .cse1 (= addflt_~b |addflt_#in~b|))) (not (= |addflt_#in~b| (_ bv0 32))) (bvsle (bvadd (bvneg ((_ sign_extend 1) addflt_~eb~0)) ((_ sign_extend 1) addflt_~ea~0)) (_ bv2147483647 33)) (or (and (= addflt_~ea~0 (_ bv127 32)) .cse1) .cse2) (not (= addflt_~b (_ bv0 32))) (not (= |addflt_#in~a| (_ bv0 32))) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))) (or .cse0 .cse2 (= addflt_~eb~0 (_ bv127 32))))) [2023-02-15 13:45:29,822 INFO L899 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2023-02-15 13:45:29,822 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2023-02-15 13:45:29,822 INFO L899 garLoopResultBuilder]: For program point addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 101) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 147) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 125) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L895 garLoopResultBuilder]: At program point L145(lines 94 147) the Hoare annotation is: (let ((.cse2 (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (let ((.cse1 (not .cse2)) (.cse0 (= addflt_~b (_ bv0 32))) (.cse3 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse5 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (not (= |addflt_#in~a| (_ bv0 32)))) (let ((.cse4 (= addflt_~b |addflt_#in~b|))) (or .cse1 (and .cse2 .cse3 .cse4 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (and .cse2 .cse3 .cse0 .cse4))) (or .cse1 (and (= addflt_~ea~0 (_ bv127 32)) (= addflt_~eb~0 (_ bv127 32))) .cse5) (or (not (= |addflt_#in~b| (_ bv0 32))) .cse0) (or .cse3 .cse5)))) [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 148) the Hoare annotation is: true [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point addfltEXIT(lines 84 148) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-15 13:45:29,823 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L113-1(line 113) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2023-02-15 13:45:29,824 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2023-02-15 13:45:29,825 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-15 13:45:29,825 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 16 21) no Hoare annotation was computed. [2023-02-15 13:45:29,825 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 16 21) no Hoare annotation was computed. [2023-02-15 13:45:29,825 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 21) the Hoare annotation is: true [2023-02-15 13:45:29,825 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2023-02-15 13:45:29,828 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 13:45:29,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:45:29,835 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 13:45:29,835 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 13:45:29,835 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 13:45:29,840 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 13:45:29,840 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 13:45:29,841 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 13:45:29,842 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 13:45:29,844 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 13:45:29,845 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 13:45:29,845 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 13:45:29,845 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 13:45:29,846 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 13:45:29,846 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 13:45:29,847 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 13:45:29,847 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 13:45:29,848 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 13:45:29,848 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 13:45:29,848 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 13:45:29,851 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:29,852 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:29,852 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 13:45:29,853 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 13:45:29,853 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 13:45:29,853 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 13:45:29,853 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 13:45:29,853 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 13:45:29,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:45:29 BoogieIcfgContainer [2023-02-15 13:45:29,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:45:29,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:45:29,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:45:29,855 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:45:29,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:11" (3/4) ... [2023-02-15 13:45:29,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 13:45:29,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 13:45:29,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2023-02-15 13:45:29,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 13:45:29,876 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-15 13:45:29,877 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 13:45:29,877 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 13:45:29,877 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 13:45:29,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:29,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:29,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:29,899 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:29,900 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((b == 0bv32 || !(\old(a) == 0bv32)) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || (((0bv32 == ~bvadd128(\old(a), 1bv32) && ~bvadd128(a, 1bv32) == 0bv32) && b == \old(b)) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32)))) || (((0bv32 == ~bvadd128(\old(a), 1bv32) && ~bvadd128(a, 1bv32) == 0bv32) && b == 0bv32) && b == \old(b)))) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || (ea == 127bv32 && eb == 127bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (!(\old(b) == 0bv32) || b == 0bv32)) && (~bvadd128(a, 1bv32) == 0bv32 || !(~bvadd128(\old(b), 1bv32) == 0bv32)) [2023-02-15 13:45:29,925 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:45:29,926 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:45:29,926 INFO L158 Benchmark]: Toolchain (without parser) took 18949.24ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 69.2MB in the beginning and 45.8MB in the end (delta: 23.4MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,926 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 65.0MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:29,927 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.47ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 55.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.01ms. Allocated memory is still 92.3MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,928 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 52.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,932 INFO L158 Benchmark]: RCFGBuilder took 534.06ms. Allocated memory is still 92.3MB. Free memory was 52.1MB in the beginning and 62.0MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,932 INFO L158 Benchmark]: TraceAbstraction took 17895.31ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 50.0MB in the end (delta: 11.5MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,933 INFO L158 Benchmark]: Witness Printer took 71.25ms. Allocated memory is still 111.1MB. Free memory was 50.0MB in the beginning and 45.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 13:45:29,938 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.15ms. Allocated memory is still 65.0MB. Free memory is still 41.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.47ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 55.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.01ms. Allocated memory is still 92.3MB. Free memory was 55.3MB in the beginning and 53.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 52.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 534.06ms. Allocated memory is still 92.3MB. Free memory was 52.1MB in the beginning and 62.0MB in the end (delta: -9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17895.31ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 61.5MB in the beginning and 50.0MB in the end (delta: 11.5MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 71.25ms. Allocated memory is still 111.1MB. Free memory was 50.0MB in the beginning and 45.8MB 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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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_2,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: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 8615 SdHoareTripleChecker+Invalid, 3.3s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 1104 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.6s 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, 304 NumberOfFragments, 419 HoareAnnotationTreeSize, 181 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 33648 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s 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 13:45:29,961 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 13:45:29,961 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 13:45:29,961 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 13:45:29,962 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 13:45:29,962 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 13:45:29,962 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(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 13:45:29,963 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 13:45:29,964 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 13:45:29,964 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 13:45:29,964 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 13:45:29,965 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 13:45:29,965 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 58]: Loop Invariant [2023-02-15 13:45:29,965 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 13:45:29,967 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 13:45:29,967 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 13:45:29,968 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 13:45:29,968 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 13:45:29,968 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 94]: Loop Invariant [2023-02-15 13:45:29,968 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:29,969 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((b == 0bv32 || !(\old(a) == 0bv32)) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || (((0bv32 == ~bvadd128(\old(a), 1bv32) && ~bvadd128(a, 1bv32) == 0bv32) && b == \old(b)) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32)))) || (((0bv32 == ~bvadd128(\old(a), 1bv32) && ~bvadd128(a, 1bv32) == 0bv32) && b == 0bv32) && b == \old(b)))) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || (ea == 127bv32 && eb == 127bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (!(\old(b) == 0bv32) || b == 0bv32)) && (~bvadd128(a, 1bv32) == 0bv32 || !(~bvadd128(\old(b), 1bv32) == 0bv32)) - InvariantResult [Line: 36]: Loop Invariant [2023-02-15 13:45:29,972 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 13:45:29,972 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 13:45:29,972 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 13:45:29,972 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 13:45:29,972 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 13:45:29,973 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: ((\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)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) RESULT: Ultimate proved your program to be correct! [2023-02-15 13:45:29,985 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