./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.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_3a.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:44:38,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:44:38,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:44:38,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:44:38,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:44:38,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:44:38,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:44:38,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:44:38,347 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:44:38,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:44:38,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:44:38,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:44:38,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:44:38,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:44:38,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:44:38,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:44:38,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:44:38,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:44:38,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:44:38,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:44:38,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:44:38,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:44:38,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:44:38,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:44:38,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:44:38,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:44:38,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:44:38,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:44:38,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:44:38,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:44:38,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:44:38,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:44:38,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:44:38,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:44:38,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:44:38,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:44:38,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:44:38,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:44:38,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:44:38,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:44:38,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:44:38,383 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:38,405 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:44:38,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:44:38,406 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:44:38,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:44:38,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:44:38,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:44:38,407 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:44:38,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:44:38,408 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:44:38,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:44:38,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:44:38,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:44:38,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:44:38,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:44:38,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:44:38,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:38,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:44:38,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:44:38,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:44:38,412 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:44:38,413 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:44:38,413 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-15 13:44:38,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:44:38,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:44:38,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:44:38,652 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:44:38,653 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:44:38,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 13:44:39,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:44:39,788 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:44:39,789 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 13:44:39,800 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139e85882/4321b6b72ba2402ab0f1a0710b942adb/FLAG51196253d [2023-02-15 13:44:39,812 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139e85882/4321b6b72ba2402ab0f1a0710b942adb [2023-02-15 13:44:39,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:44:39,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:44:39,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:39,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:44:39,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:44:39,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:39" (1/1) ... [2023-02-15 13:44:39,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff347b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:39, skipping insertion in model container [2023-02-15 13:44:39,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:39" (1/1) ... [2023-02-15 13:44:39,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:44:39,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:44:39,952 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_3a.c.cil.c[728,741] [2023-02-15 13:44:39,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:39,995 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:44:40,002 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_3a.c.cil.c[728,741] [2023-02-15 13:44:40,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:40,031 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:44:40,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:40 WrapperNode [2023-02-15 13:44:40,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:40,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:40,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:44:40,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:44:40,036 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:40" (1/1) ... [2023-02-15 13:44:40,050 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:40" (1/1) ... [2023-02-15 13:44:40,067 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2023-02-15 13:44:40,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:40,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:44:40,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:44:40,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:44:40,074 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:40" (1/1) ... [2023-02-15 13:44:40,074 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:40" (1/1) ... [2023-02-15 13:44:40,076 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:40" (1/1) ... [2023-02-15 13:44:40,076 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:40" (1/1) ... [2023-02-15 13:44:40,081 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:40" (1/1) ... [2023-02-15 13:44:40,084 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:40" (1/1) ... [2023-02-15 13:44:40,085 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:40" (1/1) ... [2023-02-15 13:44:40,086 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:40" (1/1) ... [2023-02-15 13:44:40,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:44:40,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:44:40,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:44:40,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:44:40,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:40" (1/1) ... [2023-02-15 13:44:40,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:40,140 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:40,145 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:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:44:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:44:40,199 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:44:40,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:44:40,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:44:40,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:44:40,257 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:44:40,259 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:44:40,565 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:44:40,571 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:44:40,572 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:44:40,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:40 BoogieIcfgContainer [2023-02-15 13:44:40,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:44:40,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:44:40,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:44:40,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:44:40,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:44:39" (1/3) ... [2023-02-15 13:44:40,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679df520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:40, skipping insertion in model container [2023-02-15 13:44:40,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:40" (2/3) ... [2023-02-15 13:44:40,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679df520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:40, skipping insertion in model container [2023-02-15 13:44:40,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:40" (3/3) ... [2023-02-15 13:44:40,578 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-15 13:44:40,589 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:44:40,589 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-15 13:44:40,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:44:40,625 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;@4ebe6d97, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:44:40,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-15 13:44:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:44:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:44:40,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:40,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:40,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:40,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 186900082, now seen corresponding path program 1 times [2023-02-15 13:44:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:40,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788555791] [2023-02-15 13:44:40,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:40,846 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:40,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:40,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788555791] [2023-02-15 13:44:40,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788555791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:40,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:40,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:40,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321331339] [2023-02-15 13:44:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:40,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:40,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:40,888 INFO L87 Difference]: Start difference. First operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:41,012 INFO L93 Difference]: Finished difference Result 263 states and 382 transitions. [2023-02-15 13:44:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:41,014 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:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:41,020 INFO L225 Difference]: With dead ends: 263 [2023-02-15 13:44:41,020 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:44:41,023 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:41,025 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:41,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:44:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-02-15 13:44:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 118 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2023-02-15 13:44:41,056 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 9 [2023-02-15 13:44:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:41,056 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2023-02-15 13:44:41,056 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:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2023-02-15 13:44:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:44:41,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:41,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:41,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:44:41,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:41,059 INFO L85 PathProgramCache]: Analyzing trace with hash 207635630, now seen corresponding path program 1 times [2023-02-15 13:44:41,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:41,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133577865] [2023-02-15 13:44:41,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:41,118 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:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:41,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133577865] [2023-02-15 13:44:41,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133577865] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:41,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:41,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934876785] [2023-02-15 13:44:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:41,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:41,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:41,121 INFO L87 Difference]: Start difference. First operand 125 states and 166 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:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:41,239 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2023-02-15 13:44:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:41,239 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:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:41,244 INFO L225 Difference]: With dead ends: 275 [2023-02-15 13:44:41,245 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 13:44:41,251 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:41,253 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 128 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:41,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 367 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 13:44:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2023-02-15 13:44:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 127 states have internal predecessors, (170), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2023-02-15 13:44:41,277 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 14 [2023-02-15 13:44:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:41,277 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2023-02-15 13:44:41,278 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:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2023-02-15 13:44:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:44:41,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:41,278 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:41,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:44:41,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2141737346, now seen corresponding path program 1 times [2023-02-15 13:44:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:41,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16122636] [2023-02-15 13:44:41,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:41,342 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:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:41,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16122636] [2023-02-15 13:44:41,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16122636] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:41,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:41,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261577062] [2023-02-15 13:44:41,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:41,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:41,344 INFO L87 Difference]: Start difference. First operand 134 states and 178 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:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:41,423 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2023-02-15 13:44:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:41,423 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:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:41,425 INFO L225 Difference]: With dead ends: 161 [2023-02-15 13:44:41,425 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 13:44:41,427 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:41,430 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:41,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 13:44:41,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2023-02-15 13:44:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5) internal successors, (168), 127 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2023-02-15 13:44:41,452 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 15 [2023-02-15 13:44:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:41,452 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2023-02-15 13:44:41,452 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:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2023-02-15 13:44:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:44:41,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:41,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:41,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:44:41,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash -966415747, now seen corresponding path program 1 times [2023-02-15 13:44:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:41,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895646435] [2023-02-15 13:44:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:44:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:41,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895646435] [2023-02-15 13:44:41,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895646435] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:41,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:41,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:44:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236476690] [2023-02-15 13:44:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:41,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:44:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:41,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:44:41,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:44:41,484 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:41,505 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2023-02-15 13:44:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:44:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 13:44:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:41,507 INFO L225 Difference]: With dead ends: 142 [2023-02-15 13:44:41,507 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 13:44:41,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:44:41,512 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:41,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 13:44:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-15 13:44:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.490909090909091) internal successors, (164), 124 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2023-02-15 13:44:41,522 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 16 [2023-02-15 13:44:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:41,522 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2023-02-15 13:44:41,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2023-02-15 13:44:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:41,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:41,523 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:41,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:44:41,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 108044843, now seen corresponding path program 1 times [2023-02-15 13:44:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:41,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265269531] [2023-02-15 13:44:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:41,607 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:41,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265269531] [2023-02-15 13:44:41,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265269531] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005749800] [2023-02-15 13:44:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:41,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:41,610 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:41,632 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:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:41,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:44:41,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:41,717 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:41,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005749800] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:41,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:41,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 13:44:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306558841] [2023-02-15 13:44:41,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:41,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:41,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:44:41,723 INFO L87 Difference]: Start difference. First operand 131 states and 172 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:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:41,762 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2023-02-15 13:44:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:41,762 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:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:41,764 INFO L225 Difference]: With dead ends: 160 [2023-02-15 13:44:41,764 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 13:44:41,769 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:41,770 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 16 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:41,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 13:44:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2023-02-15 13:44:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 126 states have internal predecessors, (167), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-15 13:44:41,779 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 17 [2023-02-15 13:44:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:41,779 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-15 13:44:41,780 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:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2023-02-15 13:44:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:44:41,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:41,781 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:41,787 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:41,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:41,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash -406903932, now seen corresponding path program 1 times [2023-02-15 13:44:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:41,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626697125] [2023-02-15 13:44:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,043 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:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626697125] [2023-02-15 13:44:42,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626697125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:42,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:42,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039604107] [2023-02-15 13:44:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:42,045 INFO L87 Difference]: Start difference. First operand 133 states and 175 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:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:42,077 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2023-02-15 13:44:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:42,078 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:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:42,079 INFO L225 Difference]: With dead ends: 166 [2023-02-15 13:44:42,079 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 13:44:42,080 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:42,080 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:42,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 13:44:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 135. [2023-02-15 13:44:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 128 states have internal predecessors, (169), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2023-02-15 13:44:42,091 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 19 [2023-02-15 13:44:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:42,091 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2023-02-15 13:44:42,092 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:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2023-02-15 13:44:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:42,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:42,096 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:42,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:44:42,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 906124417, now seen corresponding path program 1 times [2023-02-15 13:44:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:42,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109919245] [2023-02-15 13:44:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,178 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:42,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109919245] [2023-02-15 13:44:42,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109919245] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:42,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:42,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884335159] [2023-02-15 13:44:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:42,181 INFO L87 Difference]: Start difference. First operand 135 states and 177 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:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:42,248 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2023-02-15 13:44:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:42,249 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:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:42,252 INFO L225 Difference]: With dead ends: 198 [2023-02-15 13:44:42,252 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 13:44:42,252 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:42,253 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:42,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 295 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 13:44:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 166. [2023-02-15 13:44:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 158 states have internal predecessors, (214), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2023-02-15 13:44:42,259 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 24 [2023-02-15 13:44:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:42,259 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2023-02-15 13:44:42,259 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:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2023-02-15 13:44:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:42,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:42,261 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:42,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:44:42,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 877497061, now seen corresponding path program 1 times [2023-02-15 13:44:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:42,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722836368] [2023-02-15 13:44:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,341 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:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722836368] [2023-02-15 13:44:42,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722836368] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:42,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:42,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26336529] [2023-02-15 13:44:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:42,343 INFO L87 Difference]: Start difference. First operand 166 states and 222 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:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:42,408 INFO L93 Difference]: Finished difference Result 190 states and 251 transitions. [2023-02-15 13:44:42,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:42,409 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:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:42,409 INFO L225 Difference]: With dead ends: 190 [2023-02-15 13:44:42,409 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 13:44:42,410 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:42,411 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:42,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:42,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 13:44:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 159. [2023-02-15 13:44:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.463768115942029) internal successors, (202), 151 states have internal predecessors, (202), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2023-02-15 13:44:42,420 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 24 [2023-02-15 13:44:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:42,421 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2023-02-15 13:44:42,421 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:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2023-02-15 13:44:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:44:42,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:42,422 INFO L195 NwaCegarLoop]: trace histogram [4, 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:42,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:44:42,423 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:42,423 INFO L85 PathProgramCache]: Analyzing trace with hash -339740318, now seen corresponding path program 1 times [2023-02-15 13:44:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:42,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260602150] [2023-02-15 13:44:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:44:42,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260602150] [2023-02-15 13:44:42,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260602150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:42,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:42,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559072350] [2023-02-15 13:44:42,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:42,504 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:42,556 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2023-02-15 13:44:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-15 13:44:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:42,558 INFO L225 Difference]: With dead ends: 183 [2023-02-15 13:44:42,558 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 13:44:42,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:42,561 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:42,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 288 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 13:44:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 153. [2023-02-15 13:44:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 145 states have internal predecessors, (193), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2023-02-15 13:44:42,569 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 31 [2023-02-15 13:44:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:42,570 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2023-02-15 13:44:42,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2023-02-15 13:44:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:44:42,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:42,573 INFO L195 NwaCegarLoop]: trace histogram [4, 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:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:44:42,573 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -368367674, now seen corresponding path program 1 times [2023-02-15 13:44:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657601067] [2023-02-15 13:44:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:44:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657601067] [2023-02-15 13:44:42,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657601067] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:42,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:42,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897018493] [2023-02-15 13:44:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:42,630 INFO L87 Difference]: Start difference. First operand 153 states and 201 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:42,685 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2023-02-15 13:44:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:42,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-15 13:44:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:42,686 INFO L225 Difference]: With dead ends: 175 [2023-02-15 13:44:42,686 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 13:44:42,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:42,687 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:42,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 286 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 13:44:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2023-02-15 13:44:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 136 states have internal predecessors, (181), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2023-02-15 13:44:42,694 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 31 [2023-02-15 13:44:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:42,694 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2023-02-15 13:44:42,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2023-02-15 13:44:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:44:42,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:42,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:42,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:44:42,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1493195762, now seen corresponding path program 1 times [2023-02-15 13:44:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:42,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936166183] [2023-02-15 13:44:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:44:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:42,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936166183] [2023-02-15 13:44:42,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936166183] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:42,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896327528] [2023-02-15 13:44:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:42,775 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:42,778 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:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:42,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 13:44:42,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:44:42,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:42,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896327528] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:42,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:44:42,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2023-02-15 13:44:42,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369821511] [2023-02-15 13:44:42,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:42,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:44:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:44:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:42,956 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:43,001 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2023-02-15 13:44:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-02-15 13:44:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:43,002 INFO L225 Difference]: With dead ends: 232 [2023-02-15 13:44:43,002 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:44:43,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:44:43,002 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 37 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:43,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 459 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:44:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2023-02-15 13:44:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 136 states have internal predecessors, (179), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2023-02-15 13:44:43,023 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 35 [2023-02-15 13:44:43,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:43,023 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2023-02-15 13:44:43,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:43,023 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2023-02-15 13:44:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:43,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:43,023 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 13:44:43,030 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:43,228 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:43,228 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1303876285, now seen corresponding path program 1 times [2023-02-15 13:44:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:43,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063419706] [2023-02-15 13:44:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:44:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:43,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063419706] [2023-02-15 13:44:43,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063419706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:43,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719322543] [2023-02-15 13:44:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:43,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:43,299 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:43,301 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:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:44:43,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:44:43,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 13:44:43,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719322543] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:43,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:44:43,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2023-02-15 13:44:43,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661435942] [2023-02-15 13:44:43,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:43,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:44:43,436 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:43,449 INFO L93 Difference]: Finished difference Result 186 states and 235 transitions. [2023-02-15 13:44:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:43,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-02-15 13:44:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:43,450 INFO L225 Difference]: With dead ends: 186 [2023-02-15 13:44:43,450 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:44:43,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:44:43,451 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:43,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:44:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-02-15 13:44:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 136 states have internal predecessors, (178), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2023-02-15 13:44:43,457 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 39 [2023-02-15 13:44:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:43,457 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2023-02-15 13:44:43,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2023-02-15 13:44:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:44:43,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:43,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:44:43,463 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:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:43,663 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1765516932, now seen corresponding path program 1 times [2023-02-15 13:44:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033420304] [2023-02-15 13:44:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033420304] [2023-02-15 13:44:43,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033420304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:43,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234157673] [2023-02-15 13:44:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:43,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:43,745 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:43,747 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:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:43,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:44:43,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:43,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:43,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234157673] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:43,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:43,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-15 13:44:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633760792] [2023-02-15 13:44:43,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:43,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:44:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:44:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:44:43,851 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:43,894 INFO L93 Difference]: Finished difference Result 242 states and 301 transitions. [2023-02-15 13:44:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:44:43,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-15 13:44:43,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:43,895 INFO L225 Difference]: With dead ends: 242 [2023-02-15 13:44:43,895 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 13:44:43,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:43,896 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:43,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 561 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 13:44:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2023-02-15 13:44:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 141 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:44:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2023-02-15 13:44:43,904 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 40 [2023-02-15 13:44:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:43,904 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2023-02-15 13:44:43,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2023-02-15 13:44:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:44:43,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:43,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:44:43,911 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:44,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:44,110 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1708258630, now seen corresponding path program 1 times [2023-02-15 13:44:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:44,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519899312] [2023-02-15 13:44:44,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:44:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:44,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519899312] [2023-02-15 13:44:44,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519899312] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:44,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970430076] [2023-02-15 13:44:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:44,178 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:44,220 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:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:44:44,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:44:44,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:44,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970430076] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:44,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:44,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2023-02-15 13:44:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031155796] [2023-02-15 13:44:44,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:44:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:44:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:44:44,407 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 13:44:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:44,672 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2023-02-15 13:44:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:44:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2023-02-15 13:44:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:44,674 INFO L225 Difference]: With dead ends: 413 [2023-02-15 13:44:44,674 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 13:44:44,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-02-15 13:44:44,675 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 97 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:44,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1183 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:44:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 13:44:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2023-02-15 13:44:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.36) internal successors, (170), 134 states have internal predecessors, (170), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2023-02-15 13:44:44,681 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 40 [2023-02-15 13:44:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:44,681 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2023-02-15 13:44:44,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 13:44:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2023-02-15 13:44:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:44:44,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:44,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 13:44:44,687 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:44,886 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,SelfDestructingSolverStorable13 [2023-02-15 13:44:44,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2065115993, now seen corresponding path program 1 times [2023-02-15 13:44:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:44,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636925541] [2023-02-15 13:44:44,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 13:44:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 13:44:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636925541] [2023-02-15 13:44:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636925541] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:44,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685555137] [2023-02-15 13:44:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:44,982 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:45,012 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:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:44:45,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:44:45,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:45,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685555137] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:45,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:45,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-02-15 13:44:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558781686] [2023-02-15 13:44:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:45,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:44:45,081 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,144 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2023-02-15 13:44:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:45,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2023-02-15 13:44:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,146 INFO L225 Difference]: With dead ends: 311 [2023-02-15 13:44:45,146 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 13:44:45,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:45,147 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:45,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 325 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 13:44:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2023-02-15 13:44:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.347457627118644) internal successors, (159), 127 states have internal predecessors, (159), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2023-02-15 13:44:45,166 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 56 [2023-02-15 13:44:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,166 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2023-02-15 13:44:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2023-02-15 13:44:45,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 13:44:45,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,167 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 13:44:45,173 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:45,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 13:44:45,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash -699283725, now seen corresponding path program 1 times [2023-02-15 13:44:45,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634707541] [2023-02-15 13:44:45,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 13:44:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-15 13:44:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:45,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634707541] [2023-02-15 13:44:45,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634707541] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:45,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992284318] [2023-02-15 13:44:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:45,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:45,440 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:45,442 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:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:45,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:44:45,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:44:45,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:45,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992284318] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:45,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:45,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-15 13:44:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116943575] [2023-02-15 13:44:45,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:45,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:44:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:44:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:45,612 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:45,768 INFO L93 Difference]: Finished difference Result 572 states and 721 transitions. [2023-02-15 13:44:45,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:44:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-02-15 13:44:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:45,770 INFO L225 Difference]: With dead ends: 572 [2023-02-15 13:44:45,770 INFO L226 Difference]: Without dead ends: 464 [2023-02-15 13:44:45,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2023-02-15 13:44:45,771 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 275 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:45,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 426 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-02-15 13:44:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 163. [2023-02-15 13:44:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 154 states have internal predecessors, (193), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2023-02-15 13:44:45,781 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 57 [2023-02-15 13:44:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:45,781 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2023-02-15 13:44:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2023-02-15 13:44:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 13:44:45,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:45,782 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1] [2023-02-15 13:44:45,793 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:45,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:45,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1499167963, now seen corresponding path program 1 times [2023-02-15 13:44:45,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:45,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851706840] [2023-02-15 13:44:45,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 13:44:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 13:44:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:46,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851706840] [2023-02-15 13:44:46,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851706840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:46,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492443285] [2023-02-15 13:44:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:46,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:46,101 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:46,103 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:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:46,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:44:46,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:44:46,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:46,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492443285] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:46,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:46,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-15 13:44:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721910616] [2023-02-15 13:44:46,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:46,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:44:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:46,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:44:46,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:44:46,270 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:44:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:47,008 INFO L93 Difference]: Finished difference Result 403 states and 506 transitions. [2023-02-15 13:44:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:44:47,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2023-02-15 13:44:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:47,010 INFO L225 Difference]: With dead ends: 403 [2023-02-15 13:44:47,010 INFO L226 Difference]: Without dead ends: 281 [2023-02-15 13:44:47,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:44:47,010 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:47,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 513 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-15 13:44:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 156. [2023-02-15 13:44:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 147 states have internal predecessors, (179), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:44:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2023-02-15 13:44:47,019 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 61 [2023-02-15 13:44:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:47,019 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2023-02-15 13:44:47,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:44:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2023-02-15 13:44:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 13:44:47,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:47,020 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 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] [2023-02-15 13:44:47,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 13:44:47,224 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,SelfDestructingSolverStorable16 [2023-02-15 13:44:47,224 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:47,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:47,225 INFO L85 PathProgramCache]: Analyzing trace with hash 239667187, now seen corresponding path program 2 times [2023-02-15 13:44:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:47,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824593881] [2023-02-15 13:44:47,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:47,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 13:44:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-15 13:44:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:44:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824593881] [2023-02-15 13:44:47,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824593881] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635992627] [2023-02-15 13:44:47,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:44:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:47,359 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:44:47,404 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:44:47,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:44:47,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:44:47,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:44:47,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-15 13:44:47,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635992627] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-02-15 13:44:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766682818] [2023-02-15 13:44:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:44:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:44:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:44:47,483 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:47,563 INFO L93 Difference]: Finished difference Result 294 states and 349 transitions. [2023-02-15 13:44:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:44:47,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-02-15 13:44:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:47,565 INFO L225 Difference]: With dead ends: 294 [2023-02-15 13:44:47,565 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 13:44:47,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:44:47,565 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 94 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:47,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 742 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 13:44:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 177. [2023-02-15 13:44:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2721518987341771) internal successors, (201), 167 states have internal predecessors, (201), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:44:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2023-02-15 13:44:47,575 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 77 [2023-02-15 13:44:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2023-02-15 13:44:47,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:44:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2023-02-15 13:44:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-15 13:44:47,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:47,577 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 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] [2023-02-15 13:44:47,584 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:44:47,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 13:44:47,782 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2114891252, now seen corresponding path program 1 times [2023-02-15 13:44:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:47,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462800520] [2023-02-15 13:44:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 13:44:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-15 13:44:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:47,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462800520] [2023-02-15 13:44:47,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462800520] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:47,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869567812] [2023-02-15 13:44:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:47,925 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:44:47,944 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:44:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:47,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:44:47,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:48,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:48,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869567812] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:48,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:48,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-15 13:44:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672841402] [2023-02-15 13:44:48,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:48,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 13:44:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 13:44:48,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:44:48,290 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:48,660 INFO L93 Difference]: Finished difference Result 986 states and 1243 transitions. [2023-02-15 13:44:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:44:48,660 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2023-02-15 13:44:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:48,663 INFO L225 Difference]: With dead ends: 986 [2023-02-15 13:44:48,663 INFO L226 Difference]: Without dead ends: 857 [2023-02-15 13:44:48,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=488, Invalid=772, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 13:44:48,664 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 536 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:48,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1047 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:44:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-02-15 13:44:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 224. [2023-02-15 13:44:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 214 states have internal predecessors, (259), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:44:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 268 transitions. [2023-02-15 13:44:48,679 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 268 transitions. Word has length 82 [2023-02-15 13:44:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:48,679 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 268 transitions. [2023-02-15 13:44:48,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 268 transitions. [2023-02-15 13:44:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 13:44:48,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:48,680 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 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:44:48,684 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:44:48,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:48,884 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:48,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1818476286, now seen corresponding path program 1 times [2023-02-15 13:44:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:48,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322742136] [2023-02-15 13:44:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:48,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 13:44:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 13:44:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:49,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322742136] [2023-02-15 13:44:49,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322742136] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:49,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500914219] [2023-02-15 13:44:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:49,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:49,069 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:44:49,112 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:44:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:49,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:44:49,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 32 proven. 75 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:49,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:49,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500914219] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:49,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:49,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 13:44:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904026059] [2023-02-15 13:44:49,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:49,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:44:49,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:44:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:44:49,463 INFO L87 Difference]: Start difference. First operand 224 states and 268 transitions. Second operand has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:44:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:55,955 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2023-02-15 13:44:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 13:44:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2023-02-15 13:44:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:55,957 INFO L225 Difference]: With dead ends: 589 [2023-02-15 13:44:55,958 INFO L226 Difference]: Without dead ends: 446 [2023-02-15 13:44:55,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=504, Invalid=902, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 13:44:55,959 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 201 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:55,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 993 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:44:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-02-15 13:44:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 217. [2023-02-15 13:44:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 198 states have (on average 1.2171717171717171) internal successors, (241), 207 states have internal predecessors, (241), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:44:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2023-02-15 13:44:55,971 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 86 [2023-02-15 13:44:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:55,971 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2023-02-15 13:44:55,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:44:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2023-02-15 13:44:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-02-15 13:44:55,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:55,972 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 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] [2023-02-15 13:44:55,993 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:44:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:56,178 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:56,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1334776844, now seen corresponding path program 2 times [2023-02-15 13:44:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:56,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657480961] [2023-02-15 13:44:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-15 13:44:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-02-15 13:44:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657480961] [2023-02-15 13:44:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657480961] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:56,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139927618] [2023-02-15 13:44:56,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:44:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:56,542 INFO L229 MonitoredProcess]: Starting monitored process 13 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:56,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:44:56,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:44:56,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:44:56,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:44:56,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:56,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:57,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139927618] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:57,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-15 13:44:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225438541] [2023-02-15 13:44:57,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:57,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 13:44:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 13:44:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 13:44:57,412 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:58,222 INFO L93 Difference]: Finished difference Result 1730 states and 2195 transitions. [2023-02-15 13:44:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 13:44:58,223 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2023-02-15 13:44:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:58,227 INFO L225 Difference]: With dead ends: 1730 [2023-02-15 13:44:58,227 INFO L226 Difference]: Without dead ends: 1601 [2023-02-15 13:44:58,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1744, Invalid=2812, Unknown=0, NotChecked=0, Total=4556 [2023-02-15 13:44:58,229 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1351 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:58,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1135 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:44:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2023-02-15 13:44:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 304. [2023-02-15 13:44:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 285 states have (on average 1.2175438596491228) internal successors, (347), 294 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:44:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 356 transitions. [2023-02-15 13:44:58,259 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 356 transitions. Word has length 122 [2023-02-15 13:44:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:58,259 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 356 transitions. [2023-02-15 13:44:58,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:44:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 356 transitions. [2023-02-15 13:44:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-15 13:44:58,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:58,262 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 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:44:58,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-15 13:44:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 13:44:58,467 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:44:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash 783253250, now seen corresponding path program 2 times [2023-02-15 13:44:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395717836] [2023-02-15 13:44:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-02-15 13:44:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-02-15 13:44:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 4 proven. 471 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:44:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395717836] [2023-02-15 13:44:58,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395717836] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375115173] [2023-02-15 13:44:58,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:44:58,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:58,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:58,961 INFO L229 MonitoredProcess]: Starting monitored process 14 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:58,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:44:59,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:44:59,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:44:59,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:44:59,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-15 13:44:59,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-15 13:44:59,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375115173] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:59,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:59,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 28 [2023-02-15 13:44:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041662563] [2023-02-15 13:44:59,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:59,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:44:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:59,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:44:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:44:59,382 INFO L87 Difference]: Start difference. First operand 304 states and 356 transitions. Second operand has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 13:45:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:00,133 INFO L93 Difference]: Finished difference Result 698 states and 839 transitions. [2023-02-15 13:45:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:45:00,134 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 126 [2023-02-15 13:45:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:00,136 INFO L225 Difference]: With dead ends: 698 [2023-02-15 13:45:00,136 INFO L226 Difference]: Without dead ends: 566 [2023-02-15 13:45:00,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 13:45:00,137 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 381 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:00,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2421 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:45:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-15 13:45:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 313. [2023-02-15 13:45:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 292 states have (on average 1.2089041095890412) internal successors, (353), 300 states have internal predecessors, (353), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:45:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 366 transitions. [2023-02-15 13:45:00,156 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 366 transitions. Word has length 126 [2023-02-15 13:45:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:00,157 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 366 transitions. [2023-02-15 13:45:00,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 13:45:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 366 transitions. [2023-02-15 13:45:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-15 13:45:00,158 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:00,158 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 3, 3, 3, 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] [2023-02-15 13:45:00,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:45:00,363 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -303496585, now seen corresponding path program 1 times [2023-02-15 13:45:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:00,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16062004] [2023-02-15 13:45:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-15 13:45:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 13:45:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 4 proven. 547 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:45:00,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:00,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16062004] [2023-02-15 13:45:00,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16062004] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:00,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038357704] [2023-02-15 13:45:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:00,879 INFO L229 MonitoredProcess]: Starting monitored process 15 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,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:45:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:00,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 13:45:00,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-15 13:45:01,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-15 13:45:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038357704] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:01,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:01,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 9] total 36 [2023-02-15 13:45:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771464506] [2023-02-15 13:45:01,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:01,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 13:45:01,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:01,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 13:45:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 13:45:01,746 INFO L87 Difference]: Start difference. First operand 313 states and 366 transitions. Second operand has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 13:45:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:03,293 INFO L93 Difference]: Finished difference Result 876 states and 1049 transitions. [2023-02-15 13:45:03,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 13:45:03,298 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 136 [2023-02-15 13:45:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:03,300 INFO L225 Difference]: With dead ends: 876 [2023-02-15 13:45:03,300 INFO L226 Difference]: Without dead ends: 735 [2023-02-15 13:45:03,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=437, Invalid=2755, Unknown=0, NotChecked=0, Total=3192 [2023-02-15 13:45:03,302 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 755 mSDsluCounter, 3071 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:03,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 3272 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:45:03,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2023-02-15 13:45:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 329. [2023-02-15 13:45:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.2124183006535947) internal successors, (371), 314 states have internal predecessors, (371), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-15 13:45:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 388 transitions. [2023-02-15 13:45:03,327 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 388 transitions. Word has length 136 [2023-02-15 13:45:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:03,327 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 388 transitions. [2023-02-15 13:45:03,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 13:45:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 388 transitions. [2023-02-15 13:45:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-02-15 13:45:03,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:03,328 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 3, 3, 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] [2023-02-15 13:45:03,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:03,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:03,534 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1862848251, now seen corresponding path program 1 times [2023-02-15 13:45:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:03,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758864562] [2023-02-15 13:45:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:04,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 13:45:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 4 proven. 622 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:45:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758864562] [2023-02-15 13:45:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758864562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798483395] [2023-02-15 13:45:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:04,053 INFO L229 MonitoredProcess]: Starting monitored process 16 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:04,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 13:45:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:04,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 13:45:04,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2023-02-15 13:45:04,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798483395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:04,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:04,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 29 [2023-02-15 13:45:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814032966] [2023-02-15 13:45:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:04,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:45:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:45:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-02-15 13:45:04,424 INFO L87 Difference]: Start difference. First operand 329 states and 388 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:04,775 INFO L93 Difference]: Finished difference Result 544 states and 643 transitions. [2023-02-15 13:45:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 141 [2023-02-15 13:45:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:04,777 INFO L225 Difference]: With dead ends: 544 [2023-02-15 13:45:04,777 INFO L226 Difference]: Without dead ends: 501 [2023-02-15 13:45:04,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 13:45:04,778 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 209 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:04,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1416 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:45:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-02-15 13:45:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 362. [2023-02-15 13:45:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 338 states have (on average 1.2218934911242603) internal successors, (413), 344 states have internal predecessors, (413), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 13:45:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 433 transitions. [2023-02-15 13:45:04,811 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 433 transitions. Word has length 141 [2023-02-15 13:45:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:04,812 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 433 transitions. [2023-02-15 13:45:04,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 433 transitions. [2023-02-15 13:45:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 13:45:04,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:04,813 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2023-02-15 13:45:04,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:05,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:05,018 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -8442539, now seen corresponding path program 1 times [2023-02-15 13:45:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:05,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23504059] [2023-02-15 13:45:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 13:45:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:45:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23504059] [2023-02-15 13:45:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23504059] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775072405] [2023-02-15 13:45:05,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:05,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:05,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:05,505 INFO L229 MonitoredProcess]: Starting monitored process 17 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:05,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 13:45:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:45:05,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-15 13:45:05,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775072405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:05,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:05,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2023-02-15 13:45:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521981538] [2023-02-15 13:45:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:05,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:05,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:05,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:45:05,955 INFO L87 Difference]: Start difference. First operand 362 states and 433 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:06,146 INFO L93 Difference]: Finished difference Result 460 states and 543 transitions. [2023-02-15 13:45:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:06,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2023-02-15 13:45:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:06,148 INFO L225 Difference]: With dead ends: 460 [2023-02-15 13:45:06,148 INFO L226 Difference]: Without dead ends: 456 [2023-02-15 13:45:06,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:45:06,149 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 183 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:06,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 639 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-15 13:45:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 395. [2023-02-15 13:45:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 371 states have (on average 1.2237196765498652) internal successors, (454), 377 states have internal predecessors, (454), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 13:45:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 474 transitions. [2023-02-15 13:45:06,175 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 474 transitions. Word has length 142 [2023-02-15 13:45:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:06,175 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 474 transitions. [2023-02-15 13:45:06,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 474 transitions. [2023-02-15 13:45:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 13:45:06,177 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:06,177 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 3, 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] [2023-02-15 13:45:06,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:06,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:45:06,382 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1414285669, now seen corresponding path program 1 times [2023-02-15 13:45:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:06,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888295614] [2023-02-15 13:45:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 13:45:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-02-15 13:45:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888295614] [2023-02-15 13:45:06,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888295614] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:06,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:06,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:45:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080622850] [2023-02-15 13:45:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:06,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:06,451 INFO L87 Difference]: Start difference. First operand 395 states and 474 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:06,499 INFO L93 Difference]: Finished difference Result 657 states and 806 transitions. [2023-02-15 13:45:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 142 [2023-02-15 13:45:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:06,501 INFO L225 Difference]: With dead ends: 657 [2023-02-15 13:45:06,501 INFO L226 Difference]: Without dead ends: 439 [2023-02-15 13:45:06,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:06,502 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 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:45:06,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-15 13:45:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 415. [2023-02-15 13:45:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 391 states have (on average 1.2122762148337596) internal successors, (474), 397 states have internal predecessors, (474), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 13:45:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 494 transitions. [2023-02-15 13:45:06,561 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 494 transitions. Word has length 142 [2023-02-15 13:45:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:06,562 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 494 transitions. [2023-02-15 13:45:06,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 494 transitions. [2023-02-15 13:45:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 13:45:06,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:06,567 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:06,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:45:06,569 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash -261718500, now seen corresponding path program 1 times [2023-02-15 13:45:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:06,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566297284] [2023-02-15 13:45:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 13:45:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:45:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566297284] [2023-02-15 13:45:07,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566297284] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8509116] [2023-02-15 13:45:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:07,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:07,101 INFO L229 MonitoredProcess]: Starting monitored process 18 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:07,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 13:45:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:45:07,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-15 13:45:07,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:07,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8509116] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2023-02-15 13:45:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079761636] [2023-02-15 13:45:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:07,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:07,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:07,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:45:07,570 INFO L87 Difference]: Start difference. First operand 415 states and 494 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:07,746 INFO L93 Difference]: Finished difference Result 483 states and 567 transitions. [2023-02-15 13:45:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 143 [2023-02-15 13:45:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:07,748 INFO L225 Difference]: With dead ends: 483 [2023-02-15 13:45:07,748 INFO L226 Difference]: Without dead ends: 474 [2023-02-15 13:45:07,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:45:07,749 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 166 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:07,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 674 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-02-15 13:45:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 415. [2023-02-15 13:45:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 391 states have (on average 1.2046035805626598) internal successors, (471), 397 states have internal predecessors, (471), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 13:45:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 491 transitions. [2023-02-15 13:45:07,775 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 491 transitions. Word has length 143 [2023-02-15 13:45:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:07,775 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 491 transitions. [2023-02-15 13:45:07,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 491 transitions. [2023-02-15 13:45:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 13:45:07,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:07,777 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:07,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:07,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:45:07,982 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -280681651, now seen corresponding path program 1 times [2023-02-15 13:45:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:07,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924841414] [2023-02-15 13:45:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 13:45:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-15 13:45:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924841414] [2023-02-15 13:45:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924841414] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761677340] [2023-02-15 13:45:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:08,180 INFO L229 MonitoredProcess]: Starting monitored process 19 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:08,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 13:45:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:45:08,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 13:45:08,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-15 13:45:08,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761677340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:08,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:08,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2023-02-15 13:45:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016697154] [2023-02-15 13:45:08,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:08,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:45:08,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:45:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:45:08,490 INFO L87 Difference]: Start difference. First operand 415 states and 491 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 13:45:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:09,359 INFO L93 Difference]: Finished difference Result 1205 states and 1401 transitions. [2023-02-15 13:45:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:45:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 143 [2023-02-15 13:45:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:09,362 INFO L225 Difference]: With dead ends: 1205 [2023-02-15 13:45:09,362 INFO L226 Difference]: Without dead ends: 1155 [2023-02-15 13:45:09,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 13:45:09,363 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1391 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:09,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 3610 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:45:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2023-02-15 13:45:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 449. [2023-02-15 13:45:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 423 states have (on average 1.2056737588652482) internal successors, (510), 427 states have internal predecessors, (510), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 17 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 13:45:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2023-02-15 13:45:09,394 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 143 [2023-02-15 13:45:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:09,394 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2023-02-15 13:45:09,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 13:45:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2023-02-15 13:45:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 13:45:09,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:09,396 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:09,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:09,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 13:45:09,601 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -280679729, now seen corresponding path program 1 times [2023-02-15 13:45:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:09,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80782692] [2023-02-15 13:45:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 13:45:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 13:45:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 4 proven. 616 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 13:45:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80782692] [2023-02-15 13:45:10,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80782692] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:10,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129094524] [2023-02-15 13:45:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:10,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:10,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:10,061 INFO L229 MonitoredProcess]: Starting monitored process 20 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:10,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 13:45:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:45:10,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 13:45:10,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 13:45:10,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129094524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:10,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:10,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 10] total 39 [2023-02-15 13:45:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765935744] [2023-02-15 13:45:10,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:10,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 13:45:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 13:45:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 13:45:10,994 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 13:45:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:13,088 INFO L93 Difference]: Finished difference Result 1243 states and 1490 transitions. [2023-02-15 13:45:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 13:45:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 143 [2023-02-15 13:45:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:13,091 INFO L225 Difference]: With dead ends: 1243 [2023-02-15 13:45:13,091 INFO L226 Difference]: Without dead ends: 966 [2023-02-15 13:45:13,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=549, Invalid=3873, Unknown=0, NotChecked=0, Total=4422 [2023-02-15 13:45:13,092 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1108 mSDsluCounter, 3577 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:13,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3840 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 13:45:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-02-15 13:45:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 456. [2023-02-15 13:45:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 430 states have (on average 1.2069767441860466) internal successors, (519), 433 states have internal predecessors, (519), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 13:45:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 544 transitions. [2023-02-15 13:45:13,125 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 544 transitions. Word has length 143 [2023-02-15 13:45:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:13,125 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 544 transitions. [2023-02-15 13:45:13,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 13:45:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 544 transitions. [2023-02-15 13:45:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-02-15 13:45:13,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:13,127 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 3, 3, 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:13,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:45:13,336 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:45:13,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 158634451, now seen corresponding path program 1 times [2023-02-15 13:45:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183229317] [2023-02-15 13:45:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-02-15 13:45:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-02-15 13:45:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,826 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:45:13,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:13,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183229317] [2023-02-15 13:45:13,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183229317] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:13,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163272808] [2023-02-15 13:45:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:13,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:13,828 INFO L229 MonitoredProcess]: Starting monitored process 21 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:13,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 13:45:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:13,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 13:45:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 38 proven. 680 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:45:14,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 13:45:15,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163272808] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:15,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:15,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2023-02-15 13:45:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579024244] [2023-02-15 13:45:15,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:15,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 13:45:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 13:45:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=2545, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 13:45:15,108 INFO L87 Difference]: Start difference. First operand 456 states and 544 transitions. Second operand has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:45:28,229 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 58 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:45:45,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 13:45:47,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 13:45:55,668 WARN L233 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 70 DAG size of output: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:46:25,541 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification. DAG size of input: 53 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:47:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:30,884 INFO L93 Difference]: Finished difference Result 1387 states and 1729 transitions. [2023-02-15 13:47:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-02-15 13:47:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2023-02-15 13:47:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:30,887 INFO L225 Difference]: With dead ends: 1387 [2023-02-15 13:47:30,887 INFO L226 Difference]: Without dead ends: 1081 [2023-02-15 13:47:30,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 129.3s TimeCoverageRelationStatistics Valid=2586, Invalid=6319, Unknown=25, NotChecked=0, Total=8930 [2023-02-15 13:47:30,890 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 681 mSDsluCounter, 3037 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 3875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:30,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3190 Invalid, 3875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3792 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2023-02-15 13:47:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-02-15 13:47:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 484. [2023-02-15 13:47:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 458 states have (on average 1.1790393013100438) internal successors, (540), 461 states have internal predecessors, (540), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 13:47:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 565 transitions. [2023-02-15 13:47:30,926 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 565 transitions. Word has length 148 [2023-02-15 13:47:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:30,926 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 565 transitions. [2023-02-15 13:47:30,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:47:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 565 transitions. [2023-02-15 13:47:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-15 13:47:30,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:30,928 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 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:47:30,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-15 13:47:31,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:47:31,133 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1909714657, now seen corresponding path program 2 times [2023-02-15 13:47:31,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:47:31,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692892793] [2023-02-15 13:47:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:47:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:47:31,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:47:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:47:31,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:47:31,233 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:47:31,234 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-15 13:47:31,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-15 13:47:31,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-15 13:47:31,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-15 13:47:31,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-15 13:47:31,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-15 13:47:31,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-15 13:47:31,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-15 13:47:31,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-15 13:47:31,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-15 13:47:31,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-15 13:47:31,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 13:47:31,241 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:31,243 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:47:31,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:47:31 BoogieIcfgContainer [2023-02-15 13:47:31,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:47:31,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:47:31,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:47:31,311 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:47:31,312 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:40" (3/4) ... [2023-02-15 13:47:31,313 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:47:31,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:47:31,314 INFO L158 Benchmark]: Toolchain (without parser) took 171497.43ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 108.6MB in the beginning and 130.3MB in the end (delta: -21.8MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,314 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:47:31,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.00ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 95.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.62ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,317 INFO L158 Benchmark]: Boogie Preprocessor took 20.39ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,319 INFO L158 Benchmark]: RCFGBuilder took 484.21ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 116.5MB in the end (delta: -25.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,322 INFO L158 Benchmark]: TraceAbstraction took 170736.47ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 115.4MB in the beginning and 131.4MB in the end (delta: -16.0MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2023-02-15 13:47:31,322 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 272.6MB. Free memory was 131.4MB in the beginning and 130.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:47:31,324 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 67.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.00ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 95.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.62ms. Allocated memory is still 155.2MB. Free memory was 95.0MB in the beginning and 92.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.39ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 90.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.21ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 116.5MB in the end (delta: -25.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 170736.47ms. Allocated memory was 155.2MB in the beginning and 272.6MB in the end (delta: 117.4MB). Free memory was 115.4MB in the beginning and 131.4MB in the end (delta: -16.0MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 272.6MB. Free memory was 131.4MB in the beginning and 130.3MB in the end (delta: 1.0MB). 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: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 171. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-127, eb=-128] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-127, eb=-128, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, one=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=36028797035741185, __retres4=16777217, e=-128, m=16777217, res=16777217] [L241] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797035741185, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L242] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L165] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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 3 procedures, 109 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 170.6s, OverallIterations: 31, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 151.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 8667 SdHoareTripleChecker+Valid, 12.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8633 mSDsluCounter, 30022 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26531 mSDsCounter, 555 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14596 IncrementalHoareTripleChecker+Invalid, 15152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 555 mSolverCounterUnsat, 3491 mSDtfsCounter, 14596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3791 GetRequests, 3114 SyntacticMatches, 4 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5894 ImplicationChecksByTransitivity, 142.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=484occurred in iteration=30, InterpolantAutomatonStates: 488, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 5883 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 4176 NumberOfCodeBlocks, 4118 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 5187 ConstructedInterpolants, 0 QuantifiedInterpolants, 20669 SizeOfPredicates, 78 NumberOfNonLiveVariables, 4379 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 64 InterpolantComputations, 18 PerfectInterpolantSequences, 9156/17048 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:47:31,506 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_3a.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:47:33,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:47:33,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:47:33,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:47:33,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:47:33,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:47:33,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:47:33,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:47:33,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:47:33,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:47:33,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:47:33,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:47:33,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:47:33,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:47:33,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:47:33,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:47:33,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:47:33,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:47:33,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:47:33,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:47:33,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:47:33,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:47:33,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:47:33,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:47:33,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:47:33,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:47:33,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:47:33,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:47:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:47:33,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:47:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:47:33,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:47:33,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:47:33,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:47:33,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:47:33,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:47:33,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:47:33,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:47:33,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:47:33,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:47:33,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:47:33,175 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:47:33,214 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:47:33,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:47:33,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:47:33,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:47:33,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:47:33,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:47:33,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:47:33,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:47:33,217 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:47:33,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:47:33,218 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:47:33,218 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:47:33,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:47:33,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:47:33,219 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:47:33,220 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:47:33,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:47:33,220 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:47:33,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:47:33,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:47:33,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:47:33,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:47:33,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:47:33,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:47:33,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:47:33,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:47:33,221 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:47:33,222 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:47:33,223 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-15 13:47:33,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:47:33,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:47:33,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:47:33,463 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:47:33,463 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:47:33,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 13:47:34,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:47:34,681 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:47:34,681 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 13:47:34,686 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5c5d42a/90fbf130c1d24f6994889412fbe9a914/FLAG889c81cf4 [2023-02-15 13:47:34,695 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5c5d42a/90fbf130c1d24f6994889412fbe9a914 [2023-02-15 13:47:34,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:47:34,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:47:34,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:47:34,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:47:34,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:47:34,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275fe12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34, skipping insertion in model container [2023-02-15 13:47:34,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:47:34,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:47:34,801 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_3a.c.cil.c[728,741] [2023-02-15 13:47:34,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:47:34,836 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:47:34,844 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_3a.c.cil.c[728,741] [2023-02-15 13:47:34,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:47:34,875 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:47:34,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34 WrapperNode [2023-02-15 13:47:34,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:47:34,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:47:34,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:47:34,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:47:34,880 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:47:34" (1/1) ... [2023-02-15 13:47:34,887 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:47:34" (1/1) ... [2023-02-15 13:47:34,909 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2023-02-15 13:47:34,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:47:34,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:47:34,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:47:34,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:47:34,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,952 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:47:34,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:47:34,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:47:34,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:47:34,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (1/1) ... [2023-02-15 13:47:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:47:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:47:34,983 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:47:35,003 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:47:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:47:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:47:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:47:35,015 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:47:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:47:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:47:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:47:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:47:35,090 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:47:35,091 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:47:35,423 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:47:35,430 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:47:35,430 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:47:35,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:47:35 BoogieIcfgContainer [2023-02-15 13:47:35,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:47:35,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:47:35,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:47:35,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:47:35,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:47:34" (1/3) ... [2023-02-15 13:47:35,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145844a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:47:35, skipping insertion in model container [2023-02-15 13:47:35,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:47:34" (2/3) ... [2023-02-15 13:47:35,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145844a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:47:35, skipping insertion in model container [2023-02-15 13:47:35,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:47:35" (3/3) ... [2023-02-15 13:47:35,439 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-15 13:47:35,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:47:35,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-15 13:47:35,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:47:35,484 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;@36748eda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:47:35,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-15 13:47:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:47:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:47:35,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:35,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:35,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1033814779, now seen corresponding path program 1 times [2023-02-15 13:47:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:35,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000151305] [2023-02-15 13:47:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:35,510 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:47:35,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:35,512 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:47:35,513 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:47:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:35,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 13:47:35,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:35,564 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:47:35,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:47:35,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:35,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000151305] [2023-02-15 13:47:35,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000151305] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:47:35,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:47:35,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:47:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795369138] [2023-02-15 13:47:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:47:35,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:47:35,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:47:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:47:35,587 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:47:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:35,605 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2023-02-15 13:47:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:47:35,606 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:47:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:35,610 INFO L225 Difference]: With dead ends: 159 [2023-02-15 13:47:35,611 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 13:47:35,613 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:47:35,615 INFO L413 NwaCegarLoop]: 96 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, 96 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:47:35,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:47:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 13:47:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-15 13:47:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 51 states have internal predecessors, (59), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-02-15 13:47:35,639 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 9 [2023-02-15 13:47:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:35,639 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-02-15 13:47:35,639 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:47:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-02-15 13:47:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:47:35,640 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:35,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:35,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 13:47:35,846 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:47:35,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1034756045, now seen corresponding path program 1 times [2023-02-15 13:47:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:35,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744009992] [2023-02-15 13:47:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:35,850 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:47:35,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:35,851 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:47:35,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 (3)] Waiting until timeout for monitored process [2023-02-15 13:47:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:35,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:47:35,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:35,928 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:47:35,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:47:35,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744009992] [2023-02-15 13:47:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744009992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:47:35,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:47:35,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:47:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436520076] [2023-02-15 13:47:35,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:47:35,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:47:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:35,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:47:35,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:47:35,935 INFO L87 Difference]: Start difference. First operand 57 states and 67 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:47:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:35,986 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2023-02-15 13:47:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:47:35,987 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:47:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:35,989 INFO L225 Difference]: With dead ends: 119 [2023-02-15 13:47:35,989 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 13:47:35,989 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:47:35,990 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:35,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 178 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:47:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 13:47:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-02-15 13:47:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 55 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2023-02-15 13:47:35,999 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 9 [2023-02-15 13:47:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:35,999 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2023-02-15 13:47:35,999 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:47:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2023-02-15 13:47:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:47:36,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:36,000 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:36,008 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:47:36,206 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:47:36,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1755996823, now seen corresponding path program 1 times [2023-02-15 13:47:36,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:36,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710909480] [2023-02-15 13:47:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:36,208 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:47:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:36,210 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:47:36,212 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:47:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:36,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:47:36,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:36,276 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:47:36,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:47:36,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:36,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710909480] [2023-02-15 13:47:36,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710909480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:47:36,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:47:36,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:47:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332325426] [2023-02-15 13:47:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:47:36,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:47:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:47:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:47:36,278 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:36,360 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2023-02-15 13:47:36,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:47:36,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 13:47:36,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:36,361 INFO L225 Difference]: With dead ends: 151 [2023-02-15 13:47:36,361 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:47:36,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:47:36,363 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:36,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 169 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:47:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:47:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-15 13:47:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 84 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2023-02-15 13:47:36,370 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 16 [2023-02-15 13:47:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:36,370 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2023-02-15 13:47:36,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2023-02-15 13:47:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:47:36,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:36,371 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:47:36,381 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:47:36,572 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:47:36,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1427259253, now seen corresponding path program 1 times [2023-02-15 13:47:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:36,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49630356] [2023-02-15 13:47:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:36,573 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:47:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:36,578 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:47:36,580 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:47:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:47:36,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:36,661 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:47:36,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:47:36,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49630356] [2023-02-15 13:47:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49630356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:47:36,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:47:36,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:47:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41915628] [2023-02-15 13:47:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:47:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:47:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:47:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:47:36,663 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:47:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:36,717 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2023-02-15 13:47:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:47:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:47:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:36,719 INFO L225 Difference]: With dead ends: 162 [2023-02-15 13:47:36,719 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 13:47:36,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:47:36,720 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:36,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 238 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:47:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 13:47:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2023-02-15 13:47:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 73 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-02-15 13:47:36,726 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2023-02-15 13:47:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-02-15 13:47:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:47:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-02-15 13:47:36,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:47:36,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:36,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:36,735 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:47:36,934 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:47:36,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1427150149, now seen corresponding path program 1 times [2023-02-15 13:47:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:36,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946018963] [2023-02-15 13:47:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:36,935 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:47:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:36,936 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:47:36,939 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:47:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:36,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:47:36,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:36,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:37,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:37,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:37,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946018963] [2023-02-15 13:47:37,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946018963] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:37,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:37,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 13:47:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199801140] [2023-02-15 13:47:37,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:37,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:47:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:47:37,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:47:37,066 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:37,393 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2023-02-15 13:47:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:47:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 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:47:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:37,395 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:47:37,395 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 13:47:37,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:47:37,396 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:37,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 271 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:47:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 13:47:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-15 13:47:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.25) internal successors, (85), 74 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-15 13:47:37,409 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 21 [2023-02-15 13:47:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:37,409 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 13:47:37,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2023-02-15 13:47:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:47:37,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:37,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:37,429 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 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:47:37,620 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:47:37,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 268685593, now seen corresponding path program 1 times [2023-02-15 13:47:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:37,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292649897] [2023-02-15 13:47:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:37,621 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:47:37,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:37,622 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:47:37,624 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:47:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:37,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:47:37,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:37,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:37,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:37,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292649897] [2023-02-15 13:47:37,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292649897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:37,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:37,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 13:47:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227827030] [2023-02-15 13:47:37,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:37,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:47:37,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:47:37,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:47:37,770 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:37,952 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2023-02-15 13:47:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:47:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-15 13:47:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:37,954 INFO L225 Difference]: With dead ends: 176 [2023-02-15 13:47:37,954 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 13:47:37,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:47:37,955 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:37,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 474 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:47:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 13:47:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2023-02-15 13:47:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 92 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-15 13:47:37,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 26 [2023-02-15 13:47:37,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:37,970 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-15 13:47:37,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:37,970 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-15 13:47:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 13:47:37,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:37,973 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:47:37,988 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:47:38,179 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:47:38,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1743264717, now seen corresponding path program 1 times [2023-02-15 13:47:38,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:38,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122968538] [2023-02-15 13:47:38,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:38,180 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:47:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:38,181 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:47:38,183 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:47:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:38,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:47:38,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:38,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:38,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122968538] [2023-02-15 13:47:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122968538] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:38,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:38,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 13:47:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398900956] [2023-02-15 13:47:38,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:38,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:47:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:38,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:47:38,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:47:38,479 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:38,799 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2023-02-15 13:47:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:47:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-15 13:47:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:38,801 INFO L225 Difference]: With dead ends: 243 [2023-02-15 13:47:38,801 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 13:47:38,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:47:38,802 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 348 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:47:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 13:47:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 102. [2023-02-15 13:47:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 94 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-02-15 13:47:38,813 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 38 [2023-02-15 13:47:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:38,814 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-02-15 13:47:38,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-02-15 13:47:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:47:38,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:38,815 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:38,821 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:47:39,021 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:47:39,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 171656217, now seen corresponding path program 2 times [2023-02-15 13:47:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:39,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043005820] [2023-02-15 13:47:39,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:47:39,025 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:47:39,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:39,026 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:47:39,028 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:47:39,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:47:39,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:47:39,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 13:47:39,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:39,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:39,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043005820] [2023-02-15 13:47:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043005820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:39,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:39,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 13:47:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057991462] [2023-02-15 13:47:39,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:39,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:47:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:47:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:47:39,306 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:39,737 INFO L93 Difference]: Finished difference Result 234 states and 272 transitions. [2023-02-15 13:47:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:47:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 13:47:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:39,739 INFO L225 Difference]: With dead ends: 234 [2023-02-15 13:47:39,739 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 13:47:39,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 13:47:39,740 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 320 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:39,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 814 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:47:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 13:47:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 140. [2023-02-15 13:47:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 132 states have internal predecessors, (150), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2023-02-15 13:47:39,753 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 46 [2023-02-15 13:47:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:39,753 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2023-02-15 13:47:39,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2023-02-15 13:47:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:47:39,755 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:39,755 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:39,762 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:47:39,961 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:47:39,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:39,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1551167795, now seen corresponding path program 2 times [2023-02-15 13:47:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:39,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563196322] [2023-02-15 13:47:39,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:47:39,963 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:47:39,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:39,964 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:47:39,966 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:47:39,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:47:39,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:47:39,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:47:39,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-15 13:47:40,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:47:40,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:40,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563196322] [2023-02-15 13:47:40,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563196322] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:47:40,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:47:40,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:47:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823892273] [2023-02-15 13:47:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:47:40,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:47:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:47:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:47:40,011 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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:47:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:40,030 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-15 13:47:40,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:47:40,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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 58 [2023-02-15 13:47:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:40,033 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:47:40,033 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 13:47:40,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:47:40,035 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 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:47:40,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:47:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 13:47:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2023-02-15 13:47:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 131 states have internal predecessors, (149), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2023-02-15 13:47:40,054 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 58 [2023-02-15 13:47:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:40,055 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2023-02-15 13:47:40,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 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:47:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2023-02-15 13:47:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:47:40,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:40,058 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:40,066 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:47:40,264 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:47:40,264 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1551100269, now seen corresponding path program 1 times [2023-02-15 13:47:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:40,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78733122] [2023-02-15 13:47:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:47:40,265 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:47:40,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:40,266 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:47:40,268 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:47:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:47:40,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:47:40,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:40,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:40,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78733122] [2023-02-15 13:47:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78733122] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:40,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:40,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 13:47:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769086410] [2023-02-15 13:47:40,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:40,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:47:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:40,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:47:40,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:47:40,817 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:41,955 INFO L93 Difference]: Finished difference Result 384 states and 469 transitions. [2023-02-15 13:47:41,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 13:47:41,955 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2023-02-15 13:47:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:41,957 INFO L225 Difference]: With dead ends: 384 [2023-02-15 13:47:41,957 INFO L226 Difference]: Without dead ends: 328 [2023-02-15 13:47:41,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-15 13:47:41,958 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 367 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:41,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 788 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:47:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-15 13:47:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 141. [2023-02-15 13:47:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.125) internal successors, (144), 133 states have internal predecessors, (144), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2023-02-15 13:47:41,973 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 58 [2023-02-15 13:47:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:41,973 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2023-02-15 13:47:41,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2023-02-15 13:47:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 13:47:41,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:41,974 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:41,980 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:47:42,180 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:47:42,180 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1547458023, now seen corresponding path program 3 times [2023-02-15 13:47:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:42,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512280288] [2023-02-15 13:47:42,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:47:42,181 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:47:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:42,182 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:47:42,183 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:47:42,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-15 13:47:42,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:47:42,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:47:42,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:42,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:43,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512280288] [2023-02-15 13:47:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512280288] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:43,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-15 13:47:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917580682] [2023-02-15 13:47:43,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:43,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:47:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:43,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:47:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 13:47:43,023 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:47,653 INFO L93 Difference]: Finished difference Result 487 states and 585 transitions. [2023-02-15 13:47:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-15 13:47:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-02-15 13:47:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:47,655 INFO L225 Difference]: With dead ends: 487 [2023-02-15 13:47:47,655 INFO L226 Difference]: Without dead ends: 431 [2023-02-15 13:47:47,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-15 13:47:47,657 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 728 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:47,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2993 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:47:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-02-15 13:47:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 219. [2023-02-15 13:47:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 206 states have (on average 1.1553398058252426) internal successors, (238), 211 states have internal predecessors, (238), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 246 transitions. [2023-02-15 13:47:47,672 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 246 transitions. Word has length 86 [2023-02-15 13:47:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:47,672 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 246 transitions. [2023-02-15 13:47:47,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:47:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 246 transitions. [2023-02-15 13:47:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-15 13:47:47,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:47,673 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:47,684 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:47:47,884 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:47:47,885 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1705737363, now seen corresponding path program 2 times [2023-02-15 13:47:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:47,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538931337] [2023-02-15 13:47:47,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:47:47,886 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:47:47,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:47,887 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:47:47,888 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:47:47,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:47:47,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:47:47,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:47:47,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:48,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:47:49,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:49,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538931337] [2023-02-15 13:47:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538931337] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:49,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:49,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 13:47:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695794534] [2023-02-15 13:47:49,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:49,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 13:47:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 13:47:49,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:47:49,534 INFO L87 Difference]: Start difference. First operand 219 states and 246 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:47:54,640 INFO L93 Difference]: Finished difference Result 678 states and 837 transitions. [2023-02-15 13:47:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-15 13:47:54,641 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2023-02-15 13:47:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:47:54,643 INFO L225 Difference]: With dead ends: 678 [2023-02-15 13:47:54,643 INFO L226 Difference]: Without dead ends: 622 [2023-02-15 13:47:54,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 13:47:54,644 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 764 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:47:54,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 2417 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-15 13:47:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2023-02-15 13:47:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 221. [2023-02-15 13:47:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 208 states have (on average 1.0817307692307692) internal successors, (225), 213 states have internal predecessors, (225), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:47:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2023-02-15 13:47:54,663 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 98 [2023-02-15 13:47:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:47:54,663 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2023-02-15 13:47:54,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:47:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2023-02-15 13:47:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-15 13:47:54,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:47:54,665 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:47:54,671 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:47:54,871 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:47:54,871 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:47:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:47:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash 429521305, now seen corresponding path program 4 times [2023-02-15 13:47:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:47:54,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515358376] [2023-02-15 13:47:54,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 13:47:54,872 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:47:54,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:47:54,873 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:47:54,874 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:47:54,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 13:47:54,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:47:54,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 13:47:54,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:47:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:55,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:47:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:47:57,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:47:57,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515358376] [2023-02-15 13:47:57,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515358376] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:47:57,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:47:57,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-15 13:47:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58448068] [2023-02-15 13:47:57,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:47:57,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 13:47:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:47:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 13:47:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 13:47:57,266 INFO L87 Difference]: Start difference. First operand 221 states and 233 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:48:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:26,866 INFO L93 Difference]: Finished difference Result 457 states and 523 transitions. [2023-02-15 13:48:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-15 13:48:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2023-02-15 13:48:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:26,869 INFO L225 Difference]: With dead ends: 457 [2023-02-15 13:48:26,869 INFO L226 Difference]: Without dead ends: 456 [2023-02-15 13:48:26,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-15 13:48:26,872 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 878 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:26,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 4140 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 13:48:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-15 13:48:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 339. [2023-02-15 13:48:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 326 states have (on average 1.1901840490797546) internal successors, (388), 331 states have internal predecessors, (388), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:48:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 396 transitions. [2023-02-15 13:48:26,910 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 396 transitions. Word has length 136 [2023-02-15 13:48:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:26,910 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 396 transitions. [2023-02-15 13:48:26,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:48:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 396 transitions. [2023-02-15 13:48:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-15 13:48:26,911 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:26,912 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:48:26,926 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 (14)] Ended with exit code 0 [2023-02-15 13:48:27,118 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:48:27,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2109656538, now seen corresponding path program 1 times [2023-02-15 13:48:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004451995] [2023-02-15 13:48:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:27,119 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:48:27,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:27,121 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:48:27,122 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:48:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:27,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:48:27,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-15 13:48:27,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:27,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:27,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004451995] [2023-02-15 13:48:27,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004451995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:27,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:27,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:48:27,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335515549] [2023-02-15 13:48:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:48:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:48:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:48:27,240 INFO L87 Difference]: Start difference. First operand 339 states and 396 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:48:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:27,546 INFO L93 Difference]: Finished difference Result 351 states and 411 transitions. [2023-02-15 13:48:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:48:27,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 149 [2023-02-15 13:48:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:27,547 INFO L225 Difference]: With dead ends: 351 [2023-02-15 13:48:27,548 INFO L226 Difference]: Without dead ends: 350 [2023-02-15 13:48:27,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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:48:27,548 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:27,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 130 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:48:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-02-15 13:48:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 341. [2023-02-15 13:48:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 328 states have (on average 1.1920731707317074) internal successors, (391), 333 states have internal predecessors, (391), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:48:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 399 transitions. [2023-02-15 13:48:27,588 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 399 transitions. Word has length 149 [2023-02-15 13:48:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:27,588 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-02-15 13:48:27,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:48:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 399 transitions. [2023-02-15 13:48:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-15 13:48:27,590 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:27,590 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 23, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:48:27,611 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:48:27,796 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:48:27,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -679741690, now seen corresponding path program 1 times [2023-02-15 13:48:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:27,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495149554] [2023-02-15 13:48:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:27,798 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:48:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:27,799 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:48:27,801 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:48:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:48:27,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-15 13:48:28,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:28,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:28,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495149554] [2023-02-15 13:48:28,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495149554] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:28,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:28,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:48:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866275380] [2023-02-15 13:48:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:28,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:48:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:48:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:48:28,352 INFO L87 Difference]: Start difference. First operand 341 states and 399 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:48:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:30,215 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2023-02-15 13:48:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:48:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 152 [2023-02-15 13:48:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:30,217 INFO L225 Difference]: With dead ends: 356 [2023-02-15 13:48:30,217 INFO L226 Difference]: Without dead ends: 355 [2023-02-15 13:48:30,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:48:30,218 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:30,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 195 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:48:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-02-15 13:48:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 220. [2023-02-15 13:48:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0721153846153846) internal successors, (223), 212 states have internal predecessors, (223), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:48:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 231 transitions. [2023-02-15 13:48:30,235 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 231 transitions. Word has length 152 [2023-02-15 13:48:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:30,236 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 231 transitions. [2023-02-15 13:48:30,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:48:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 231 transitions. [2023-02-15 13:48:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-15 13:48:30,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:30,237 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1] [2023-02-15 13:48:30,246 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:48:30,444 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:48:30,445 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash 765853977, now seen corresponding path program 1 times [2023-02-15 13:48:30,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:30,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013321542] [2023-02-15 13:48:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:30,446 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:48:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:30,447 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:48:30,455 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:48:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:30,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:48:30,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-15 13:48:30,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:30,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013321542] [2023-02-15 13:48:30,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013321542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:30,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:48:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203917890] [2023-02-15 13:48:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:30,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:48:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:48:30,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:48:30,535 INFO L87 Difference]: Start difference. First operand 220 states and 231 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:30,586 INFO L93 Difference]: Finished difference Result 253 states and 266 transitions. [2023-02-15 13:48:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:48:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 161 [2023-02-15 13:48:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:30,588 INFO L225 Difference]: With dead ends: 253 [2023-02-15 13:48:30,588 INFO L226 Difference]: Without dead ends: 226 [2023-02-15 13:48:30,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:48:30,589 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 3 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:30,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 295 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:48:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-15 13:48:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2023-02-15 13:48:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 210 states have (on average 1.0714285714285714) internal successors, (225), 215 states have internal predecessors, (225), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:48:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2023-02-15 13:48:30,609 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 161 [2023-02-15 13:48:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:30,610 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2023-02-15 13:48:30,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2023-02-15 13:48:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-15 13:48:30,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:30,611 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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:48:30,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 13:48:30,820 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 [2023-02-15 13:48:30,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 765465224, now seen corresponding path program 1 times [2023-02-15 13:48:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:30,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877246056] [2023-02-15 13:48:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:30,822 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:48:30,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:30,823 INFO L229 MonitoredProcess]: Starting monitored process 18 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:48:30,824 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 (18)] Waiting until timeout for monitored process [2023-02-15 13:48:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:30,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:48:30,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-15 13:48:30,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:48:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-15 13:48:30,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:30,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877246056] [2023-02-15 13:48:30,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877246056] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:48:30,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:48:30,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 13:48:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682807606] [2023-02-15 13:48:30,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:48:30,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:48:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:48:30,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:48:30,963 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:31,042 INFO L93 Difference]: Finished difference Result 255 states and 268 transitions. [2023-02-15 13:48:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:48:31,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 165 [2023-02-15 13:48:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:31,043 INFO L225 Difference]: With dead ends: 255 [2023-02-15 13:48:31,044 INFO L226 Difference]: Without dead ends: 223 [2023-02-15 13:48:31,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:48:31,044 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:31,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 423 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:48:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-15 13:48:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2023-02-15 13:48:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0625) internal successors, (221), 212 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:48:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 229 transitions. [2023-02-15 13:48:31,063 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 229 transitions. Word has length 165 [2023-02-15 13:48:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:31,065 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 229 transitions. [2023-02-15 13:48:31,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 229 transitions. [2023-02-15 13:48:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-15 13:48:31,066 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:31,066 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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] [2023-02-15 13:48:31,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 (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:48:31,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:48:31,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash -644702791, now seen corresponding path program 2 times [2023-02-15 13:48:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:31,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240839867] [2023-02-15 13:48:31,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:48:31,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:48:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:31,275 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:48:31,277 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:48:31,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:48:31,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:48:31,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:48:31,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2023-02-15 13:48:31,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:31,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:31,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240839867] [2023-02-15 13:48:31,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240839867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:31,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:31,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:48:31,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14220770] [2023-02-15 13:48:31,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:31,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:48:31,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:31,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:48:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:48:31,332 INFO L87 Difference]: Start difference. First operand 220 states and 229 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:31,462 INFO L93 Difference]: Finished difference Result 220 states and 229 transitions. [2023-02-15 13:48:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:48:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 169 [2023-02-15 13:48:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:31,464 INFO L225 Difference]: With dead ends: 220 [2023-02-15 13:48:31,464 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 13:48:31,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 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:48:31,464 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:31,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:48:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 13:48:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-15 13:48:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 208 states have (on average 1.0528846153846154) internal successors, (219), 210 states have internal predecessors, (219), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:48:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2023-02-15 13:48:31,482 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 169 [2023-02-15 13:48:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:31,482 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2023-02-15 13:48:31,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2023-02-15 13:48:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-15 13:48:31,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:31,485 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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] [2023-02-15 13:48:31,491 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:48:31,685 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:48:31,686 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 753038131, now seen corresponding path program 1 times [2023-02-15 13:48:31,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:31,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322100682] [2023-02-15 13:48:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:31,686 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:48:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:31,687 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:48:31,690 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:48:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:31,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:48:31,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-15 13:48:31,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:31,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:31,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322100682] [2023-02-15 13:48:31,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322100682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:31,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:31,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:48:31,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478997592] [2023-02-15 13:48:31,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:31,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:48:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:48:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:48:31,799 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:31,886 INFO L93 Difference]: Finished difference Result 293 states and 307 transitions. [2023-02-15 13:48:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:48:31,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 172 [2023-02-15 13:48:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:31,888 INFO L225 Difference]: With dead ends: 293 [2023-02-15 13:48:31,888 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 13:48:31,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:48:31,888 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:31,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 401 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:48:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 13:48:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 225. [2023-02-15 13:48:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 213 states have (on average 1.051643192488263) internal successors, (224), 215 states have internal predecessors, (224), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:48:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 237 transitions. [2023-02-15 13:48:31,908 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 237 transitions. Word has length 172 [2023-02-15 13:48:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:31,908 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 237 transitions. [2023-02-15 13:48:31,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 237 transitions. [2023-02-15 13:48:31,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-15 13:48:31,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:31,910 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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] [2023-02-15 13:48:31,925 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:48:32,117 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:48:32,118 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:32,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 360011121, now seen corresponding path program 1 times [2023-02-15 13:48:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:32,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884218739] [2023-02-15 13:48:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:32,118 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:48:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:32,119 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:48:32,121 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:48:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:32,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:48:32,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-15 13:48:32,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:32,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:32,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884218739] [2023-02-15 13:48:32,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884218739] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:32,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:48:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725490791] [2023-02-15 13:48:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:32,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:48:32,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:48:32,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:48:32,286 INFO L87 Difference]: Start difference. First operand 225 states and 237 transitions. Second operand has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:32,486 INFO L93 Difference]: Finished difference Result 271 states and 284 transitions. [2023-02-15 13:48:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:48:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 172 [2023-02-15 13:48:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:32,490 INFO L225 Difference]: With dead ends: 271 [2023-02-15 13:48:32,490 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 13:48:32,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:48:32,491 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 71 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:32,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 516 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:48:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 13:48:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2023-02-15 13:48:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.0495495495495495) internal successors, (233), 224 states have internal predecessors, (233), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:48:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 246 transitions. [2023-02-15 13:48:32,510 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 246 transitions. Word has length 172 [2023-02-15 13:48:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:32,510 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 246 transitions. [2023-02-15 13:48:32,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 246 transitions. [2023-02-15 13:48:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-02-15 13:48:32,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:32,511 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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] [2023-02-15 13:48:32,518 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 (21)] Ended with exit code 0 [2023-02-15 13:48:32,718 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:48:32,719 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -770221667, now seen corresponding path program 1 times [2023-02-15 13:48:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:32,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011966418] [2023-02-15 13:48:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:32,720 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:48:32,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:32,721 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:48:32,722 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:48:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:32,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:48:32,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-15 13:48:32,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:48:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-15 13:48:32,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:32,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011966418] [2023-02-15 13:48:32,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011966418] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:48:32,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:48:32,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-15 13:48:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419999956] [2023-02-15 13:48:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:32,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:48:32,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:48:32,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:48:32,926 INFO L87 Difference]: Start difference. First operand 234 states and 246 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:33,112 INFO L93 Difference]: Finished difference Result 238 states and 249 transitions. [2023-02-15 13:48:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:48:33,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 174 [2023-02-15 13:48:33,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:33,113 INFO L225 Difference]: With dead ends: 238 [2023-02-15 13:48:33,113 INFO L226 Difference]: Without dead ends: 236 [2023-02-15 13:48:33,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:48:33,114 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:33,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 178 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:48:33,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-15 13:48:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2023-02-15 13:48:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0422535211267605) internal successors, (222), 213 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:48:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 235 transitions. [2023-02-15 13:48:33,133 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 235 transitions. Word has length 174 [2023-02-15 13:48:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:33,133 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 235 transitions. [2023-02-15 13:48:33,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 235 transitions. [2023-02-15 13:48:33,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-02-15 13:48:33,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:33,134 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1] [2023-02-15 13:48:33,144 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:48:33,342 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:48:33,342 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash 948465498, now seen corresponding path program 1 times [2023-02-15 13:48:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:33,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517588339] [2023-02-15 13:48:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:33,343 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:48:33,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:33,344 INFO L229 MonitoredProcess]: Starting monitored process 23 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:48:33,344 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 (23)] Waiting until timeout for monitored process [2023-02-15 13:48:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:33,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:48:33,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-15 13:48:33,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:33,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:33,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517588339] [2023-02-15 13:48:33,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517588339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:33,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:33,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:48:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845701818] [2023-02-15 13:48:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:48:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:48:33,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:48:33,548 INFO L87 Difference]: Start difference. First operand 223 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:33,859 INFO L93 Difference]: Finished difference Result 265 states and 278 transitions. [2023-02-15 13:48:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:48:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 178 [2023-02-15 13:48:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:33,860 INFO L225 Difference]: With dead ends: 265 [2023-02-15 13:48:33,860 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 13:48:33,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:48:33,861 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:33,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 622 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:48:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 13:48:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2023-02-15 13:48:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.042654028436019) internal successors, (220), 212 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 13:48:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 232 transitions. [2023-02-15 13:48:33,880 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 232 transitions. Word has length 178 [2023-02-15 13:48:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:33,880 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 232 transitions. [2023-02-15 13:48:33,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 232 transitions. [2023-02-15 13:48:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-02-15 13:48:33,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:33,882 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1, 1] [2023-02-15 13:48:33,899 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 (23)] Ended with exit code 0 [2023-02-15 13:48:34,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:48:34,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:34,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 606708358, now seen corresponding path program 1 times [2023-02-15 13:48:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:34,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221532610] [2023-02-15 13:48:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:34,091 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:48:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:34,092 INFO L229 MonitoredProcess]: Starting monitored process 24 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:48:34,093 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 (24)] Waiting until timeout for monitored process [2023-02-15 13:48:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:34,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:48:34,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-15 13:48:34,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:48:34,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:34,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221532610] [2023-02-15 13:48:34,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221532610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:48:34,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1394099949] [2023-02-15 13:48:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:34,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:48:34,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:48:34,450 INFO L229 MonitoredProcess]: Starting monitored process 25 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:48:34,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-02-15 13:48:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:34,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:48:34,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-15 13:48:34,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:48:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-15 13:48:34,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1394099949] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:48:34,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:48:34,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-15 13:48:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443310143] [2023-02-15 13:48:34,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:48:34,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:48:34,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:34,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:48:34,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:48:34,580 INFO L87 Difference]: Start difference. First operand 221 states and 232 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:34,646 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2023-02-15 13:48:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:48:34,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 180 [2023-02-15 13:48:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:34,647 INFO L225 Difference]: With dead ends: 263 [2023-02-15 13:48:34,647 INFO L226 Difference]: Without dead ends: 243 [2023-02-15 13:48:34,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:48:34,649 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:34,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 413 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:48:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-15 13:48:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 223. [2023-02-15 13:48:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0422535211267605) internal successors, (222), 213 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 13:48:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2023-02-15 13:48:34,669 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 180 [2023-02-15 13:48:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:34,669 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2023-02-15 13:48:34,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:48:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2023-02-15 13:48:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-02-15 13:48:34,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:34,670 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1, 1] [2023-02-15 13:48:34,679 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 (24)] Forceful destruction successful, exit code 0 [2023-02-15 13:48:34,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-02-15 13:48:35,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 13:48:35,079 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -414359996, now seen corresponding path program 1 times [2023-02-15 13:48:35,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:35,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389312215] [2023-02-15 13:48:35,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:35,080 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:48:35,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:35,081 INFO L229 MonitoredProcess]: Starting monitored process 26 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:48:35,082 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 (26)] Waiting until timeout for monitored process [2023-02-15 13:48:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:35,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:48:35,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-15 13:48:35,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:35,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:35,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389312215] [2023-02-15 13:48:35,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389312215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:35,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:35,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:48:35,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934795670] [2023-02-15 13:48:35,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:35,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:48:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:48:35,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:48:35,179 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:35,258 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2023-02-15 13:48:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:48:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 180 [2023-02-15 13:48:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:35,260 INFO L225 Difference]: With dead ends: 227 [2023-02-15 13:48:35,260 INFO L226 Difference]: Without dead ends: 223 [2023-02-15 13:48:35,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 177 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:48:35,260 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:35,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:48:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-15 13:48:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2023-02-15 13:48:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0375586854460095) internal successors, (221), 213 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-15 13:48:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 233 transitions. [2023-02-15 13:48:35,279 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 233 transitions. Word has length 180 [2023-02-15 13:48:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:35,280 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 233 transitions. [2023-02-15 13:48:35,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 233 transitions. [2023-02-15 13:48:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-02-15 13:48:35,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:48:35,282 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:48:35,290 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 (26)] Forceful destruction successful, exit code 0 [2023-02-15 13:48:35,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:48:35,490 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 13:48:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:48:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1691487341, now seen corresponding path program 1 times [2023-02-15 13:48:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:48:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156572513] [2023-02-15 13:48:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:48:35,491 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:48:35,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:48:35,492 INFO L229 MonitoredProcess]: Starting monitored process 27 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:48:35,493 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 (27)] Waiting until timeout for monitored process [2023-02-15 13:48:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:48:35,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:48:35,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:48:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-15 13:48:35,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:48:35,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:48:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156572513] [2023-02-15 13:48:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156572513] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:48:35,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:48:35,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:48:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013901401] [2023-02-15 13:48:35,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:48:35,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:48:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:48:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:48:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:48:35,594 INFO L87 Difference]: Start difference. First operand 223 states and 233 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:48:35,697 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions. [2023-02-15 13:48:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:48:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2023-02-15 13:48:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:48:35,698 INFO L225 Difference]: With dead ends: 223 [2023-02-15 13:48:35,698 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 13:48:35,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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:48:35,699 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:48:35,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:48:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 13:48:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 13:48:35,700 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:48:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 13:48:35,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2023-02-15 13:48:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:48:35,700 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 13:48:35,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:48:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 13:48:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 13:48:35,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-15 13:48:35,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-15 13:48:35,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-15 13:48:35,702 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-15 13:48:35,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-15 13:48:35,704 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-15 13:48:35,713 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 (27)] Forceful destruction successful, exit code 0 [2023-02-15 13:48:35,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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:48:35,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 13:48:49,573 WARN L233 SmtUtils]: Spent 9.39s on a formula simplification. DAG size of input: 489 DAG size of output: 31 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-15 13:48:57,090 WARN L233 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 538 DAG size of output: 29 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-15 13:48:57,093 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 13:48:57,093 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 13:48:57,093 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 13:48:57,093 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-15 13:48:57,095 INFO L895 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (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|))) (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|))))) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0) (or .cse0 (not (= |base2flt_#in~m| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) (bvadd base2flt_~e (_ bv1 32)))) (or (bvult (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl base2flt_~m (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv16777216 32)) (not (bvult base2flt_~m (_ bv16777216 32)))))))) [2023-02-15 13:48:57,097 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv1 32)))) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0) (or (and (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|))) (or (not (bvsle (bvadd base2flt_~e (_ bv4294967282 32)) (_ bv4294967168 32))) .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|))))))) [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-15 13:48:57,097 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-15 13:48:57,098 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-15 13:48:57,098 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 13:48:57,100 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (and (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) (bvadd base2flt_~e (_ bv1 32)))) .cse0 (not (= |base2flt_#in~m| (_ bv1 32)))) (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|))) (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|))))) (or (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32)) (= base2flt_~e (_ bv0 32))) (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:48:57,100 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 13:48:57,100 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-15 13:48:57,101 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~e| (_ bv0 32))))) (and (or (and (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|))) (bvult base2flt_~m (_ bv16777216 32))) (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|))))) (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) (bvadd base2flt_~e (_ bv1 32)))) .cse0 (not (= |base2flt_#in~m| (_ bv1 32)))) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:48:57,101 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point L258-2(lines 258 262) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 220 274) the Hoare annotation is: true [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point L201-1(line 201) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 13:48:57,102 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point L177-1(line 177) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2023-02-15 13:48:57,103 INFO L902 garLoopResultBuilder]: At program point mulflt_returnLabel#1(lines 147 219) the Hoare annotation is: true [2023-02-15 13:48:57,103 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 253) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L244-2(lines 236 273) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L178-1(line 178) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2023-02-15 13:48:57,104 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 270) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L902 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L172-1(line 172) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 264) no Hoare annotation was computed. [2023-02-15 13:48:57,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L902 garLoopResultBuilder]: At program point L255-2(lines 255 264) the Hoare annotation is: true [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-15 13:48:57,106 INFO L902 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: true [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L902 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: true [2023-02-15 13:48:57,107 INFO L902 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: true [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2023-02-15 13:48:57,107 INFO L899 garLoopResultBuilder]: For program point L175-1(line 175) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-15 13:48:57,108 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-15 13:48:57,109 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-15 13:48:57,111 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:48:57,112 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:48:57,119 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:48:57,120 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:48:57,120 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:48:57,125 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:48:57,125 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:48:57,125 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:48:57,126 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:48:57,126 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:48:57,126 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:48:57,128 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:48:57,128 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:48:57,128 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:48:57,128 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:48:57,129 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:48:57,129 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:48:57,140 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:48:57,141 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:48:57,141 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:48:57,141 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:48:57,141 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:48:57,143 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:48:57,143 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:48:57,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:48:57 BoogieIcfgContainer [2023-02-15 13:48:57,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:48:57,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:48:57,144 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:48:57,144 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:48:57,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:47:35" (3/4) ... [2023-02-15 13:48:57,146 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 13:48:57,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 13:48:57,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 13:48:57,156 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-15 13:48:57,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 13:48:57,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 13:48:57,157 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 13:48:57,174 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) || !(\old(e) == 0bv32)) || !(\old(m) == 1bv32)) && ((\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))))) && ((((m == 0bv32 && __retres4 == 0bv32) && e == 0bv32) || !(\old(m) == 0bv32)) || !(\old(e) == 0bv32)) [2023-02-15 13:48:57,174 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)) && ~bvult32(m, 16777216bv32)) || (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)))) && (((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) || !(\old(e) == 0bv32)) || !(\old(m) == 1bv32))) && (!(\old(m) == 0bv32) || !(\old(e) == 0bv32)) [2023-02-15 13:48:57,174 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(e) == 0bv32) || !(\old(m) == 1bv32)) && (!(\old(m) == 0bv32) || !(\old(e) == 0bv32))) && (((\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)) && (!~bvsle63(~bvadd128(e, 4294967282bv32), 4294967168bv32) || !(\old(e) == 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:48:57,174 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) || !(\old(e) == 0bv32))) && ((!(\old(e) == 0bv32) || !(\old(m) == 1bv32)) || ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) && (~bvult32(~bvshl63(~bvshl63(~bvshl63(~bvshl63(~bvshl63(~bvshl63(m, 1bv32), 1bv32), 1bv32), 1bv32), 1bv32), 1bv32), 16777216bv32) || !~bvult32(m, 16777216bv32)))) [2023-02-15 13:48:57,192 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:48:57,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:48:57,192 INFO L158 Benchmark]: Toolchain (without parser) took 82495.02ms. Allocated memory was 73.4MB in the beginning and 146.8MB in the end (delta: 73.4MB). Free memory was 47.1MB in the beginning and 53.8MB in the end (delta: -6.7MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,193 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 73.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:48:57,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.49ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 79.5MB in the end (delta: -32.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 100.7MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,193 INFO L158 Benchmark]: Boogie Preprocessor took 48.25ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,194 INFO L158 Benchmark]: RCFGBuilder took 472.88ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 58.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,194 INFO L158 Benchmark]: TraceAbstraction took 81709.84ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 57.9MB in the beginning and 58.0MB in the end (delta: -99.9kB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,195 INFO L158 Benchmark]: Witness Printer took 47.89ms. Allocated memory is still 146.8MB. Free memory was 58.0MB in the beginning and 53.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 13:48:57,196 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.31ms. Allocated memory is still 73.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.49ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 46.9MB in the beginning and 79.5MB in the end (delta: -32.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 100.7MB. Free memory was 79.5MB in the beginning and 77.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.25ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.88ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 58.7MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 81709.84ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 57.9MB in the beginning and 58.0MB in the end (delta: -99.9kB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Witness Printer took 47.89ms. Allocated memory is still 146.8MB. Free memory was 58.0MB in the beginning and 53.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[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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: 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 3 procedures, 86 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 81.6s, OverallIterations: 25, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 45.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3996 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3993 mSDsluCounter, 16603 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14761 mSDsCounter, 420 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10780 IncrementalHoareTripleChecker+Invalid, 11200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 420 mSolverCounterUnsat, 1842 mSDtfsCounter, 10780 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4222 GetRequests, 3718 SyntacticMatches, 0 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4964 ImplicationChecksByTransitivity, 39.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=14, InterpolantAutomatonStates: 390, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 1406 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 160 PreInvPairs, 223 NumberOfFragments, 202 HoareAnnotationTreeSize, 160 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 51462652107 FormulaSimplificationTreeSizeReductionInter, 21.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 2838 NumberOfCodeBlocks, 2642 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3829 ConstructedInterpolants, 22 QuantifiedInterpolants, 10920 SizeOfPredicates, 63 NumberOfNonLiveVariables, 4216 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 37 InterpolantComputations, 15 PerfectInterpolantSequences, 22891/27903 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 18 specifications checked. All of them hold - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-15 13:48:57,212 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:48:57,212 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:48:57,212 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:48:57,213 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:48:57,213 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:48:57,213 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) || !(\old(e) == 0bv32))) && ((!(\old(e) == 0bv32) || !(\old(m) == 1bv32)) || ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) && (~bvult32(~bvshl63(~bvshl63(~bvshl63(~bvshl63(~bvshl63(~bvshl63(m, 1bv32), 1bv32), 1bv32), 1bv32), 1bv32), 1bv32), 16777216bv32) || !~bvult32(m, 16777216bv32)))) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant [2023-02-15 13:48:57,214 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:48:57,214 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:48:57,214 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:48:57,214 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:48:57,214 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:48:57,215 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 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) || !(\old(e) == 0bv32)) || !(\old(m) == 1bv32)) && ((\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))))) && ((((m == 0bv32 && __retres4 == 0bv32) && e == 0bv32) || !(\old(m) == 0bv32)) || !(\old(e) == 0bv32)) - InvariantResult [Line: 37]: Loop Invariant [2023-02-15 13:48:57,215 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:48:57,215 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:48:57,215 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:48:57,216 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:48:57,217 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:48:57,217 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)) && ~bvult32(m, 16777216bv32)) || (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)))) && (((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2) == ~bvadd128(e, 1bv32)) || !(\old(e) == 0bv32)) || !(\old(m) == 1bv32))) && (!(\old(m) == 0bv32) || !(\old(e) == 0bv32)) - InvariantResult [Line: 57]: Loop Invariant [2023-02-15 13:48:57,217 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:48:57,217 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:48:57,219 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:48:57,219 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: ((!(\old(e) == 0bv32) || !(\old(m) == 1bv32)) && (!(\old(m) == 0bv32) || !(\old(e) == 0bv32))) && (((\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)) && (!~bvsle63(~bvadd128(e, 4294967282bv32), 4294967168bv32) || !(\old(e) == 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: 147]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 13:48:57,234 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