./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:44:51,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:44:51,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:44:51,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:44:51,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:44:51,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:44:51,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:44:51,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:44:51,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:44:51,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:44:51,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:44:51,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:44:51,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:44:51,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:44:51,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:44:51,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:44:51,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:44:51,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:44:51,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:44:51,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:44:51,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:44:51,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:44:51,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:44:51,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:44:51,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:44:51,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:44:51,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:44:51,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:44:51,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:44:51,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:44:51,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:44:51,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:44:51,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:44:51,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:44:51,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:44:51,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:44:51,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:44:51,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:44:51,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:44:51,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:44:51,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:44:51,144 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:51,170 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:44:51,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:44:51,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:44:51,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:44:51,172 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:44:51,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:44:51,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:44:51,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:44:51,173 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:44:51,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:44:51,174 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:44:51,174 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:44:51,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:44:51,174 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:44:51,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:44:51,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:44:51,176 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:44:51,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:44:51,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:44:51,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:44:51,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:44:51,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:51,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:44:51,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:44:51,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:44:51,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:44:51,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:44:51,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:44:51,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:44:51,178 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:44:51,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:44:51,178 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:44:51,178 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2023-02-15 13:44:51,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:44:51,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:44:51,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:44:51,423 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:44:51,423 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:44:51,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-15 13:44:52,421 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:44:52,586 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:44:52,586 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-15 13:44:52,591 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a5fe2da/b972a68bca90435e8ef22eb572d23ea5/FLAGf40c1b1d5 [2023-02-15 13:44:52,600 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14a5fe2da/b972a68bca90435e8ef22eb572d23ea5 [2023-02-15 13:44:52,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:44:52,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:44:52,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:52,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:44:52,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:44:52,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:52" (1/1) ... [2023-02-15 13:44:52,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a609bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:52, skipping insertion in model container [2023-02-15 13:44:52,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:44:52" (1/1) ... [2023-02-15 13:44:52,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:44:52,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:44:52,743 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2023-02-15 13:44:52,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:52,786 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:44:52,793 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2023-02-15 13:44:52,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:44:52,820 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:44:52,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:52 WrapperNode [2023-02-15 13:44:52,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:44:52,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:52,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:44:52,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:44:52,826 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:52" (1/1) ... [2023-02-15 13:44:52,832 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:52" (1/1) ... [2023-02-15 13:44:52,842 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-15 13:44:52,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:44:52,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:44:52,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:44:52,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:44:52,850 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:52" (1/1) ... [2023-02-15 13:44:52,850 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:52" (1/1) ... [2023-02-15 13:44:52,852 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:52" (1/1) ... [2023-02-15 13:44:52,852 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:52" (1/1) ... [2023-02-15 13:44:52,856 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:52" (1/1) ... [2023-02-15 13:44:52,859 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:52" (1/1) ... [2023-02-15 13:44:52,860 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:52" (1/1) ... [2023-02-15 13:44:52,861 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:52" (1/1) ... [2023-02-15 13:44:52,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:44:52,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:44:52,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:44:52,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:44:52,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:52" (1/1) ... [2023-02-15 13:44:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:44:52,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:52,898 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:52,912 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:52,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:44:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:44:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:44:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:44:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:44:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:44:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 13:44:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 13:44:52,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:44:52,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:44:53,022 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:44:53,025 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:44:53,400 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:44:53,407 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:44:53,407 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:44:53,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:53 BoogieIcfgContainer [2023-02-15 13:44:53,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:44:53,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:44:53,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:44:53,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:44:53,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:44:52" (1/3) ... [2023-02-15 13:44:53,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5867ebb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:53, skipping insertion in model container [2023-02-15 13:44:53,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:44:52" (2/3) ... [2023-02-15 13:44:53,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5867ebb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:44:53, skipping insertion in model container [2023-02-15 13:44:53,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:44:53" (3/3) ... [2023-02-15 13:44:53,416 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2023-02-15 13:44:53,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:44:53,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:44:53,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:44:53,493 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;@378dd7e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:44:53,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:44:53,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 93 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 13:44:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:44:53,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:53,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:53,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1106600790, now seen corresponding path program 1 times [2023-02-15 13:44:53,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:53,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927276841] [2023-02-15 13:44:53,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,712 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:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:53,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927276841] [2023-02-15 13:44:53,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927276841] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:53,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:53,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15536008] [2023-02-15 13:44:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:53,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:53,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:53,744 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.6493506493506493) internal successors, (127), 93 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:53,827 INFO L93 Difference]: Finished difference Result 257 states and 375 transitions. [2023-02-15 13:44:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:53,829 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:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:53,835 INFO L225 Difference]: With dead ends: 257 [2023-02-15 13:44:53,835 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 13:44:53,839 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:53,841 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:53,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 370 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 13:44:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2023-02-15 13:44:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 122 states have internal predecessors, (167), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2023-02-15 13:44:53,878 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 9 [2023-02-15 13:44:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2023-02-15 13:44:53,879 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:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2023-02-15 13:44:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:44:53,881 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:53,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:53,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:44:53,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:53,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 888286794, now seen corresponding path program 1 times [2023-02-15 13:44:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:53,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470102484] [2023-02-15 13:44:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:53,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:53,951 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:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470102484] [2023-02-15 13:44:53,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470102484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:53,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:53,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613975601] [2023-02-15 13:44:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:53,954 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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:54,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,059 INFO L93 Difference]: Finished difference Result 257 states and 339 transitions. [2023-02-15 13:44:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:54,060 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:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,062 INFO L225 Difference]: With dead ends: 257 [2023-02-15 13:44:54,062 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 13:44:54,063 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:54,064 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 128 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 451 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 13:44:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2023-02-15 13:44:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 131 states have internal predecessors, (179), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2023-02-15 13:44:54,083 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 14 [2023-02-15 13:44:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,083 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2023-02-15 13:44:54,083 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:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2023-02-15 13:44:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:44:54,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:54,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:44:54,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1505602901, now seen corresponding path program 1 times [2023-02-15 13:44:54,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:54,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289891899] [2023-02-15 13:44:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:44:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289891899] [2023-02-15 13:44:54,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289891899] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:54,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:54,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:44:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679819521] [2023-02-15 13:44:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:54,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:44:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:44:54,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:44:54,134 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,168 INFO L93 Difference]: Finished difference Result 149 states and 201 transitions. [2023-02-15 13:44:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:44:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 13:44:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,176 INFO L225 Difference]: With dead ends: 149 [2023-02-15 13:44:54,176 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 13:44:54,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:44:54,177 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 13:44:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2023-02-15 13:44:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 129 states have internal predecessors, (176), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 191 transitions. [2023-02-15 13:44:54,187 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 191 transitions. Word has length 16 [2023-02-15 13:44:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,187 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 191 transitions. [2023-02-15 13:44:54,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 191 transitions. [2023-02-15 13:44:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:44:54,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,188 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:54,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:44:54,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1767086950, now seen corresponding path program 1 times [2023-02-15 13:44:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:54,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678557607] [2023-02-15 13:44:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,254 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:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678557607] [2023-02-15 13:44:54,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678557607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:54,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:54,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303356190] [2023-02-15 13:44:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:54,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:54,257 INFO L87 Difference]: Start difference. First operand 141 states and 191 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:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,316 INFO L93 Difference]: Finished difference Result 167 states and 218 transitions. [2023-02-15 13:44:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:54,317 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:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,318 INFO L225 Difference]: With dead ends: 167 [2023-02-15 13:44:54,318 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:44:54,318 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:54,319 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 105 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 456 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:44:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-15 13:44:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.5) internal successors, (174), 129 states have internal predecessors, (174), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 189 transitions. [2023-02-15 13:44:54,329 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 189 transitions. Word has length 15 [2023-02-15 13:44:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,329 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 189 transitions. [2023-02-15 13:44:54,329 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:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2023-02-15 13:44:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:54,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,330 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:54,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:44:54,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash -542322912, now seen corresponding path program 1 times [2023-02-15 13:44:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:54,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339772993] [2023-02-15 13:44:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,414 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:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339772993] [2023-02-15 13:44:54,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339772993] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:54,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:54,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:54,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999868657] [2023-02-15 13:44:54,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:54,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:54,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:54,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:54,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:54,415 INFO L87 Difference]: Start difference. First operand 141 states and 189 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,484 INFO L93 Difference]: Finished difference Result 199 states and 265 transitions. [2023-02-15 13:44:54,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:54,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 13:44:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,488 INFO L225 Difference]: With dead ends: 199 [2023-02-15 13:44:54,489 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:44:54,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:44:54,493 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 89 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 414 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:44:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2023-02-15 13:44:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.5174825174825175) internal successors, (217), 156 states have internal predecessors, (217), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 232 transitions. [2023-02-15 13:44:54,506 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 232 transitions. Word has length 17 [2023-02-15 13:44:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,507 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 232 transitions. [2023-02-15 13:44:54,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 232 transitions. [2023-02-15 13:44:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:54,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,507 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:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:44:54,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -570950268, now seen corresponding path program 1 times [2023-02-15 13:44:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:54,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973316666] [2023-02-15 13:44:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,570 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:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973316666] [2023-02-15 13:44:54,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973316666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:54,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:54,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545484530] [2023-02-15 13:44:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:54,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:54,584 INFO L87 Difference]: Start difference. First operand 169 states and 232 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,640 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2023-02-15 13:44:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 13:44:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,645 INFO L225 Difference]: With dead ends: 197 [2023-02-15 13:44:54,645 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 13:44:54,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:44:54,652 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 415 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 13:44:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2023-02-15 13:44:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 160 states have internal predecessors, (221), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 236 transitions. [2023-02-15 13:44:54,662 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 236 transitions. Word has length 17 [2023-02-15 13:44:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,662 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 236 transitions. [2023-02-15 13:44:54,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:44:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 236 transitions. [2023-02-15 13:44:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:44:54,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,663 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:54,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:44:54,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash 846267151, now seen corresponding path program 1 times [2023-02-15 13:44:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:54,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946953329] [2023-02-15 13:44:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,715 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:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:54,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946953329] [2023-02-15 13:44:54,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946953329] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:54,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014678280] [2023-02-15 13:44:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:54,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:54,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:54,732 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:54,734 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:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:54,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:44:54,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:54,803 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:54,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:44:54,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014678280] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:54,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:44:54,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 13:44:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880428232] [2023-02-15 13:44:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:54,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:44:54,805 INFO L87 Difference]: Start difference. First operand 173 states and 236 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:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:54,838 INFO L93 Difference]: Finished difference Result 213 states and 287 transitions. [2023-02-15 13:44:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:54,838 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:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:54,839 INFO L225 Difference]: With dead ends: 213 [2023-02-15 13:44:54,839 INFO L226 Difference]: Without dead ends: 212 [2023-02-15 13:44:54,839 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:54,840 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 252 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-15 13:44:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 168. [2023-02-15 13:44:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.4895104895104896) internal successors, (213), 155 states have internal predecessors, (213), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 228 transitions. [2023-02-15 13:44:54,855 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 228 transitions. Word has length 17 [2023-02-15 13:44:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:54,855 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 228 transitions. [2023-02-15 13:44:54,856 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:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 228 transitions. [2023-02-15 13:44:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 13:44:54,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:54,858 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:54,880 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:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:55,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 355130216, now seen corresponding path program 1 times [2023-02-15 13:44:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836026362] [2023-02-15 13:44:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,102 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:55,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:55,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836026362] [2023-02-15 13:44:55,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836026362] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:55,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:55,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:44:55,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230346780] [2023-02-15 13:44:55,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:55,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:44:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:55,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:44:55,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:44:55,118 INFO L87 Difference]: Start difference. First operand 168 states and 228 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:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:55,163 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2023-02-15 13:44:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:44:55,164 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:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:55,165 INFO L225 Difference]: With dead ends: 214 [2023-02-15 13:44:55,165 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 13:44:55,165 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:55,166 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 21 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:55,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 245 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 13:44:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2023-02-15 13:44:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 155 states have internal predecessors, (211), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 226 transitions. [2023-02-15 13:44:55,174 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 226 transitions. Word has length 19 [2023-02-15 13:44:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:55,174 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 226 transitions. [2023-02-15 13:44:55,174 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:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 226 transitions. [2023-02-15 13:44:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:55,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:55,177 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:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:44:55,177 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1004223459, now seen corresponding path program 1 times [2023-02-15 13:44:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622538978] [2023-02-15 13:44:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,235 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:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:55,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622538978] [2023-02-15 13:44:55,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622538978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:55,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:55,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:55,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942433767] [2023-02-15 13:44:55,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:55,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:55,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:55,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:55,237 INFO L87 Difference]: Start difference. First operand 168 states and 226 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:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:55,287 INFO L93 Difference]: Finished difference Result 192 states and 257 transitions. [2023-02-15 13:44:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:55,287 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:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:55,289 INFO L225 Difference]: With dead ends: 192 [2023-02-15 13:44:55,289 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 13:44:55,290 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:55,291 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 81 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:55,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 416 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 13:44:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2023-02-15 13:44:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.4532374100719425) internal successors, (202), 149 states have internal predecessors, (202), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2023-02-15 13:44:55,300 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 24 [2023-02-15 13:44:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:55,300 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2023-02-15 13:44:55,300 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:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2023-02-15 13:44:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:44:55,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:55,301 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:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:44:55,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1032850815, now seen corresponding path program 1 times [2023-02-15 13:44:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:55,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900765316] [2023-02-15 13:44:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,339 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:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900765316] [2023-02-15 13:44:55,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900765316] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:55,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:55,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:44:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199107280] [2023-02-15 13:44:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:55,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:44:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:44:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:44:55,341 INFO L87 Difference]: Start difference. First operand 162 states and 217 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:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:55,385 INFO L93 Difference]: Finished difference Result 184 states and 245 transitions. [2023-02-15 13:44:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:44:55,385 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:55,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:55,386 INFO L225 Difference]: With dead ends: 184 [2023-02-15 13:44:55,386 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 13:44:55,386 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:55,387 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:55,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 414 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:44:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 13:44:55,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2023-02-15 13:44:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 132 states have (on average 1.4393939393939394) internal successors, (190), 140 states have internal predecessors, (190), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:44:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 205 transitions. [2023-02-15 13:44:55,392 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 205 transitions. Word has length 24 [2023-02-15 13:44:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:55,393 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 205 transitions. [2023-02-15 13:44:55,393 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:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 205 transitions. [2023-02-15 13:44:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:44:55,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:55,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:55,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:44:55,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash -288190097, now seen corresponding path program 1 times [2023-02-15 13:44:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:55,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361856460] [2023-02-15 13:44:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:55,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361856460] [2023-02-15 13:44:55,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361856460] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:55,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150664391] [2023-02-15 13:44:55,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:55,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:55,538 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:55,621 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:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:55,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:44:55,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 13:44:55,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:55,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150664391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:55,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:55,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2023-02-15 13:44:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826432023] [2023-02-15 13:44:55,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:55,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:44:55,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:44:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:44:55,877 INFO L87 Difference]: Start difference. First operand 153 states and 205 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:44:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:56,246 INFO L93 Difference]: Finished difference Result 443 states and 590 transitions. [2023-02-15 13:44:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:44:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-02-15 13:44:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:56,248 INFO L225 Difference]: With dead ends: 443 [2023-02-15 13:44:56,248 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 13:44:56,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:44:56,249 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 262 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:56,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1700 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:44:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 13:44:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 134. [2023-02-15 13:44:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 118 states have internal predecessors, (153), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 13:44:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2023-02-15 13:44:56,270 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 30 [2023-02-15 13:44:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:56,270 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2023-02-15 13:44:56,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:44:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2023-02-15 13:44:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:44:56,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:56,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:56,293 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:56,471 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:56,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash 294012820, now seen corresponding path program 1 times [2023-02-15 13:44:56,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462875877] [2023-02-15 13:44:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:56,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462875877] [2023-02-15 13:44:56,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462875877] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:56,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:56,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45055805] [2023-02-15 13:44:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:56,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:56,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:56,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:56,581 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:56,674 INFO L93 Difference]: Finished difference Result 325 states and 421 transitions. [2023-02-15 13:44:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-02-15 13:44:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:56,676 INFO L225 Difference]: With dead ends: 325 [2023-02-15 13:44:56,676 INFO L226 Difference]: Without dead ends: 262 [2023-02-15 13:44:56,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:44:56,677 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:56,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1008 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-15 13:44:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 145. [2023-02-15 13:44:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.376068376068376) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-02-15 13:44:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 185 transitions. [2023-02-15 13:44:56,687 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 185 transitions. Word has length 35 [2023-02-15 13:44:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:56,688 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 185 transitions. [2023-02-15 13:44:56,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 185 transitions. [2023-02-15 13:44:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:56,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:56,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:56,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:44:56,689 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:56,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:56,689 INFO L85 PathProgramCache]: Analyzing trace with hash 379794388, now seen corresponding path program 1 times [2023-02-15 13:44:56,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:56,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327367915] [2023-02-15 13:44:56,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:56,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 13:44:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 13:44:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:56,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:56,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327367915] [2023-02-15 13:44:56,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327367915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:56,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057438122] [2023-02-15 13:44:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:56,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:56,820 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:56,849 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:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:56,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:44:56,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:56,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:57,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057438122] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:57,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:57,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-02-15 13:44:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267889321] [2023-02-15 13:44:57,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:57,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:44:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:44:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-02-15 13:44:57,090 INFO L87 Difference]: Start difference. First operand 145 states and 185 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 13:44:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:57,227 INFO L93 Difference]: Finished difference Result 317 states and 410 transitions. [2023-02-15 13:44:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 39 [2023-02-15 13:44:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:57,228 INFO L225 Difference]: With dead ends: 317 [2023-02-15 13:44:57,229 INFO L226 Difference]: Without dead ends: 239 [2023-02-15 13:44:57,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:44:57,229 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 232 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2376 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:57,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2376 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-15 13:44:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 132. [2023-02-15 13:44:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 117 states have internal predecessors, (149), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 13:44:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2023-02-15 13:44:57,236 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 39 [2023-02-15 13:44:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:57,236 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2023-02-15 13:44:57,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 13:44:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2023-02-15 13:44:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:57,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:57,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:57,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 13:44:57,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:57,442 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1945363323, now seen corresponding path program 2 times [2023-02-15 13:44:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:57,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132601911] [2023-02-15 13:44:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:44:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:57,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132601911] [2023-02-15 13:44:57,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132601911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:57,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:57,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359619462] [2023-02-15 13:44:57,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:57,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:57,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:57,516 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:57,610 INFO L93 Difference]: Finished difference Result 301 states and 388 transitions. [2023-02-15 13:44:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:44:57,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 13:44:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:57,611 INFO L225 Difference]: With dead ends: 301 [2023-02-15 13:44:57,612 INFO L226 Difference]: Without dead ends: 242 [2023-02-15 13:44:57,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:44:57,612 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 225 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:57,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1173 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-15 13:44:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2023-02-15 13:44:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.4110429447852761) internal successors, (230), 173 states have internal predecessors, (230), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-15 13:44:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 257 transitions. [2023-02-15 13:44:57,619 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 257 transitions. Word has length 39 [2023-02-15 13:44:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:57,619 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 257 transitions. [2023-02-15 13:44:57,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2023-02-15 13:44:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:57,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:57,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:57,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:44:57,620 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1945361401, now seen corresponding path program 1 times [2023-02-15 13:44:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:57,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953970979] [2023-02-15 13:44:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:44:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:57,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953970979] [2023-02-15 13:44:57,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953970979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:57,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:57,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:44:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275588598] [2023-02-15 13:44:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:57,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:57,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:57,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:57,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:57,769 INFO L87 Difference]: Start difference. First operand 193 states and 257 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:57,875 INFO L93 Difference]: Finished difference Result 389 states and 502 transitions. [2023-02-15 13:44:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:44:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 13:44:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:57,877 INFO L225 Difference]: With dead ends: 389 [2023-02-15 13:44:57,877 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 13:44:57,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:44:57,877 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 338 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:57,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1169 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 13:44:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 193. [2023-02-15 13:44:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 163 states have (on average 1.3987730061349692) internal successors, (228), 173 states have internal predecessors, (228), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-02-15 13:44:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 255 transitions. [2023-02-15 13:44:57,898 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 255 transitions. Word has length 39 [2023-02-15 13:44:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 255 transitions. [2023-02-15 13:44:57,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:44:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2023-02-15 13:44:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:44:57,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:57,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:57,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:44:57,899 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:57,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1888103099, now seen corresponding path program 1 times [2023-02-15 13:44:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:57,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120687249] [2023-02-15 13:44:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:44:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120687249] [2023-02-15 13:44:58,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120687249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564667949] [2023-02-15 13:44:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:58,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:58,041 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:58,098 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:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:44:58,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:44:58,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:44:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:44:58,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564667949] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:44:58,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:44:58,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-02-15 13:44:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860299572] [2023-02-15 13:44:58,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:44:58,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:44:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:44:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:44:58,392 INFO L87 Difference]: Start difference. First operand 193 states and 255 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:44:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:58,586 INFO L93 Difference]: Finished difference Result 494 states and 672 transitions. [2023-02-15 13:44:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:44:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2023-02-15 13:44:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:58,588 INFO L225 Difference]: With dead ends: 494 [2023-02-15 13:44:58,588 INFO L226 Difference]: Without dead ends: 386 [2023-02-15 13:44:58,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:44:58,589 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 265 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:58,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1204 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-15 13:44:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 286. [2023-02-15 13:44:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 244 states have (on average 1.4057377049180328) internal successors, (343), 255 states have internal predecessors, (343), 22 states have call successors, (22), 9 states have call predecessors, (22), 12 states have return successors, (26), 21 states have call predecessors, (26), 21 states have call successors, (26) [2023-02-15 13:44:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 391 transitions. [2023-02-15 13:44:58,600 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 391 transitions. Word has length 39 [2023-02-15 13:44:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:58,600 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 391 transitions. [2023-02-15 13:44:58,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:44:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 391 transitions. [2023-02-15 13:44:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:44:58,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:58,601 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:58,612 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:58,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 13:44:58,806 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:58,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1841081669, now seen corresponding path program 1 times [2023-02-15 13:44:58,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:58,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192656280] [2023-02-15 13:44:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:44:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:44:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:44:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:58,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192656280] [2023-02-15 13:44:58,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192656280] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:44:58,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:44:58,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:44:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045609737] [2023-02-15 13:44:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:44:58,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:44:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:44:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:44:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:44:58,921 INFO L87 Difference]: Start difference. First operand 286 states and 391 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:44:59,056 INFO L93 Difference]: Finished difference Result 626 states and 859 transitions. [2023-02-15 13:44:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:44:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2023-02-15 13:44:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:44:59,058 INFO L225 Difference]: With dead ends: 626 [2023-02-15 13:44:59,058 INFO L226 Difference]: Without dead ends: 556 [2023-02-15 13:44:59,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:44:59,059 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 298 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:44:59,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1595 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:44:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-02-15 13:44:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 324. [2023-02-15 13:44:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 278 states have (on average 1.4028776978417266) internal successors, (390), 288 states have internal predecessors, (390), 26 states have call successors, (26), 10 states have call predecessors, (26), 12 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-02-15 13:44:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 445 transitions. [2023-02-15 13:44:59,089 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 445 transitions. Word has length 43 [2023-02-15 13:44:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:44:59,089 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 445 transitions. [2023-02-15 13:44:59,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:44:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 445 transitions. [2023-02-15 13:44:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:44:59,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:44:59,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:44:59,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:44:59,090 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:44:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:44:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1106350186, now seen corresponding path program 1 times [2023-02-15 13:44:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:44:59,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560344130] [2023-02-15 13:44:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:44:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:44:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:44:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:44:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:44:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:44:59,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560344130] [2023-02-15 13:44:59,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560344130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:44:59,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360507221] [2023-02-15 13:44:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:44:59,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:44:59,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:44:59,338 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:59,340 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:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:44:59,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 13:44:59,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:44:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:44:59,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:00,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360507221] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:00,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:00,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-15 13:45:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765906391] [2023-02-15 13:45:00,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:00,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:45:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:45:00,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:45:00,088 INFO L87 Difference]: Start difference. First operand 324 states and 445 transitions. Second operand has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:45:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:00,935 INFO L93 Difference]: Finished difference Result 998 states and 1363 transitions. [2023-02-15 13:45:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:45:00,935 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2023-02-15 13:45:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:00,938 INFO L225 Difference]: With dead ends: 998 [2023-02-15 13:45:00,938 INFO L226 Difference]: Without dead ends: 903 [2023-02-15 13:45:00,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 13:45:00,940 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 502 mSDsluCounter, 3320 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:00,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 3625 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:45:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2023-02-15 13:45:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 444. [2023-02-15 13:45:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 386 states have (on average 1.422279792746114) internal successors, (549), 397 states have internal predecessors, (549), 35 states have call successors, (35), 12 states have call predecessors, (35), 15 states have return successors, (41), 34 states have call predecessors, (41), 33 states have call successors, (41) [2023-02-15 13:45:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 625 transitions. [2023-02-15 13:45:00,963 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 625 transitions. Word has length 44 [2023-02-15 13:45:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:00,963 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 625 transitions. [2023-02-15 13:45:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 19 states have internal predecessors, (67), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:45:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 625 transitions. [2023-02-15 13:45:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:45:00,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:00,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:00,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 13:45:01,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 13:45:01,169 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:01,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash -191115440, now seen corresponding path program 1 times [2023-02-15 13:45:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:01,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211011065] [2023-02-15 13:45:01,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 13:45:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211011065] [2023-02-15 13:45:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211011065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567137267] [2023-02-15 13:45:01,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:01,216 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:45:01,219 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:45:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:45:01,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:45:01,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567137267] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:01,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:01,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-15 13:45:01,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533080380] [2023-02-15 13:45:01,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:01,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:01,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:01,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:01,275 INFO L87 Difference]: Start difference. First operand 444 states and 625 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:45:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:01,314 INFO L93 Difference]: Finished difference Result 765 states and 1075 transitions. [2023-02-15 13:45:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:01,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2023-02-15 13:45:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:01,316 INFO L225 Difference]: With dead ends: 765 [2023-02-15 13:45:01,316 INFO L226 Difference]: Without dead ends: 468 [2023-02-15 13:45:01,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:01,317 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 334 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:01,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 334 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:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-02-15 13:45:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 456. [2023-02-15 13:45:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 398 states have (on average 1.4095477386934674) internal successors, (561), 409 states have internal predecessors, (561), 35 states have call successors, (35), 12 states have call predecessors, (35), 15 states have return successors, (41), 34 states have call predecessors, (41), 33 states have call successors, (41) [2023-02-15 13:45:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 637 transitions. [2023-02-15 13:45:01,339 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 637 transitions. Word has length 45 [2023-02-15 13:45:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:01,340 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 637 transitions. [2023-02-15 13:45:01,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:45:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 637 transitions. [2023-02-15 13:45:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:01,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:01,340 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:01,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 13:45:01,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:01,565 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1648526352, now seen corresponding path program 1 times [2023-02-15 13:45:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:01,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993705595] [2023-02-15 13:45:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:45:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:01,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993705595] [2023-02-15 13:45:01,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993705595] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:01,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955007237] [2023-02-15 13:45:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:01,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:01,946 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:45:01,973 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:45:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:02,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 13:45:02,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 13:45:02,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:02,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955007237] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:02,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:02,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2023-02-15 13:45:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264456046] [2023-02-15 13:45:02,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:02,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:45:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:02,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:45:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1601, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 13:45:02,793 INFO L87 Difference]: Start difference. First operand 456 states and 637 transitions. Second operand has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 13:45:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:04,932 INFO L93 Difference]: Finished difference Result 1221 states and 1764 transitions. [2023-02-15 13:45:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 13:45:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2023-02-15 13:45:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:04,936 INFO L225 Difference]: With dead ends: 1221 [2023-02-15 13:45:04,936 INFO L226 Difference]: Without dead ends: 1080 [2023-02-15 13:45:04,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=5007, Unknown=0, NotChecked=0, Total=5402 [2023-02-15 13:45:04,938 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 533 mSDsluCounter, 5925 mSDsCounter, 0 mSdLazyCounter, 2012 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 6184 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:04,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 6184 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2012 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 13:45:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-02-15 13:45:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 460. [2023-02-15 13:45:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 400 states have (on average 1.4075) internal successors, (563), 412 states have internal predecessors, (563), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (45), 35 states have call predecessors, (45), 34 states have call successors, (45) [2023-02-15 13:45:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 644 transitions. [2023-02-15 13:45:04,964 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 644 transitions. Word has length 46 [2023-02-15 13:45:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:04,964 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 644 transitions. [2023-02-15 13:45:04,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 33 states have internal predecessors, (74), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-15 13:45:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 644 transitions. [2023-02-15 13:45:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:04,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:04,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:04,989 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:45:05,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:05,171 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1789074962, now seen corresponding path program 1 times [2023-02-15 13:45:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812052677] [2023-02-15 13:45:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:45:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:05,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812052677] [2023-02-15 13:45:05,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812052677] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:05,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:05,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:45:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263516563] [2023-02-15 13:45:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:05,346 INFO L87 Difference]: Start difference. First operand 460 states and 644 transitions. Second operand has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:45:06,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 13:45:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:07,204 INFO L93 Difference]: Finished difference Result 585 states and 807 transitions. [2023-02-15 13:45:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2023-02-15 13:45:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:07,207 INFO L225 Difference]: With dead ends: 585 [2023-02-15 13:45:07,207 INFO L226 Difference]: Without dead ends: 584 [2023-02-15 13:45:07,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:45:07,208 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 314 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:07,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1091 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 13:45:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-02-15 13:45:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 458. [2023-02-15 13:45:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 398 states have (on average 1.407035175879397) internal successors, (560), 410 states have internal predecessors, (560), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (45), 35 states have call predecessors, (45), 34 states have call successors, (45) [2023-02-15 13:45:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 641 transitions. [2023-02-15 13:45:07,246 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 641 transitions. Word has length 46 [2023-02-15 13:45:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:07,246 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 641 transitions. [2023-02-15 13:45:07,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:45:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 641 transitions. [2023-02-15 13:45:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:45:07,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:07,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:07,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:45:07,248 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -544833963, now seen corresponding path program 1 times [2023-02-15 13:45:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:07,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434269313] [2023-02-15 13:45:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:45:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:45:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434269313] [2023-02-15 13:45:07,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434269313] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070247382] [2023-02-15 13:45:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:07,319 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:45:07,322 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:45:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:07,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:07,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:07,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070247382] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:07,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:07,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 13:45:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802463992] [2023-02-15 13:45:07,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:07,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:45:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:07,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:45:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:45:07,466 INFO L87 Difference]: Start difference. First operand 458 states and 641 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 13:45:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:07,579 INFO L93 Difference]: Finished difference Result 665 states and 920 transitions. [2023-02-15 13:45:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:45:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2023-02-15 13:45:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:07,582 INFO L225 Difference]: With dead ends: 665 [2023-02-15 13:45:07,582 INFO L226 Difference]: Without dead ends: 588 [2023-02-15 13:45:07,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:45:07,583 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 280 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:07,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1646 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2023-02-15 13:45:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 488. [2023-02-15 13:45:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 425 states have (on average 1.4) internal successors, (595), 435 states have internal predecessors, (595), 39 states have call successors, (39), 14 states have call predecessors, (39), 16 states have return successors, (46), 38 states have call predecessors, (46), 35 states have call successors, (46) [2023-02-15 13:45:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 680 transitions. [2023-02-15 13:45:07,612 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 680 transitions. Word has length 49 [2023-02-15 13:45:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:07,613 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 680 transitions. [2023-02-15 13:45:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 13:45:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 680 transitions. [2023-02-15 13:45:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:45:07,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:07,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:07,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:45:07,820 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash -544832041, now seen corresponding path program 1 times [2023-02-15 13:45:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:07,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684977858] [2023-02-15 13:45:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:45:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:45:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:07,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684977858] [2023-02-15 13:45:07,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684977858] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:07,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333989236] [2023-02-15 13:45:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:07,946 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:45:07,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:45:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:07,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:07,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:08,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 13:45:08,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333989236] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:08,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:08,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 14 [2023-02-15 13:45:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518821957] [2023-02-15 13:45:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:08,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:08,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:45:08,088 INFO L87 Difference]: Start difference. First operand 488 states and 680 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:08,119 INFO L93 Difference]: Finished difference Result 671 states and 937 transitions. [2023-02-15 13:45:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2023-02-15 13:45:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:08,121 INFO L225 Difference]: With dead ends: 671 [2023-02-15 13:45:08,121 INFO L226 Difference]: Without dead ends: 473 [2023-02-15 13:45:08,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:45:08,122 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:08,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-02-15 13:45:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 463. [2023-02-15 13:45:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 406 states have (on average 1.3990147783251232) internal successors, (568), 417 states have internal predecessors, (568), 35 states have call successors, (35), 11 states have call predecessors, (35), 14 states have return successors, (40), 34 states have call predecessors, (40), 33 states have call successors, (40) [2023-02-15 13:45:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 643 transitions. [2023-02-15 13:45:08,144 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 643 transitions. Word has length 49 [2023-02-15 13:45:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:08,145 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 643 transitions. [2023-02-15 13:45:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 643 transitions. [2023-02-15 13:45:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 13:45:08,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:08,146 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:08,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:08,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:08,351 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1096692583, now seen corresponding path program 1 times [2023-02-15 13:45:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:08,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421686202] [2023-02-15 13:45:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:08,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421686202] [2023-02-15 13:45:08,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421686202] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:08,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:08,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:45:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032878347] [2023-02-15 13:45:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:08,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:45:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:45:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:45:08,531 INFO L87 Difference]: Start difference. First operand 463 states and 643 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:45:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:09,017 INFO L93 Difference]: Finished difference Result 1232 states and 1775 transitions. [2023-02-15 13:45:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:45:09,017 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 13:45:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:09,021 INFO L225 Difference]: With dead ends: 1232 [2023-02-15 13:45:09,021 INFO L226 Difference]: Without dead ends: 1230 [2023-02-15 13:45:09,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:45:09,022 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 300 mSDsluCounter, 2635 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:09,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 2941 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:45:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-02-15 13:45:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 636. [2023-02-15 13:45:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 563 states have (on average 1.419182948490231) internal successors, (799), 575 states have internal predecessors, (799), 47 states have call successors, (47), 14 states have call predecessors, (47), 18 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2023-02-15 13:45:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 902 transitions. [2023-02-15 13:45:09,061 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 902 transitions. Word has length 49 [2023-02-15 13:45:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:09,061 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 902 transitions. [2023-02-15 13:45:09,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:45:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 902 transitions. [2023-02-15 13:45:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:45:09,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:09,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:09,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-15 13:45:09,063 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 72724173, now seen corresponding path program 1 times [2023-02-15 13:45:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:09,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270917034] [2023-02-15 13:45:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 13:45:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:45:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:09,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270917034] [2023-02-15 13:45:09,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270917034] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:09,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284568872] [2023-02-15 13:45:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:09,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:09,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:45:09,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:45:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:09,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:45:09,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:45:09,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:45:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284568872] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:09,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:09,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-02-15 13:45:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580439611] [2023-02-15 13:45:09,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:09,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:45:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:45:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:45:09,344 INFO L87 Difference]: Start difference. First operand 636 states and 902 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:45:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:10,048 INFO L93 Difference]: Finished difference Result 1813 states and 2621 transitions. [2023-02-15 13:45:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:45:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-02-15 13:45:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:10,053 INFO L225 Difference]: With dead ends: 1813 [2023-02-15 13:45:10,053 INFO L226 Difference]: Without dead ends: 1585 [2023-02-15 13:45:10,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:45:10,054 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 765 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3273 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:10,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3273 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:45:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2023-02-15 13:45:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 635. [2023-02-15 13:45:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 562 states have (on average 1.407473309608541) internal successors, (791), 574 states have internal predecessors, (791), 47 states have call successors, (47), 14 states have call predecessors, (47), 18 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2023-02-15 13:45:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 894 transitions. [2023-02-15 13:45:10,109 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 894 transitions. Word has length 52 [2023-02-15 13:45:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:10,109 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 894 transitions. [2023-02-15 13:45:10,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 13:45:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 894 transitions. [2023-02-15 13:45:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 13:45:10,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:10,110 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:10,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:45:10,315 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2108410851, now seen corresponding path program 1 times [2023-02-15 13:45:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868671179] [2023-02-15 13:45:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:10,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 13:45:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868671179] [2023-02-15 13:45:10,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868671179] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:10,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:10,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:45:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432803019] [2023-02-15 13:45:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:10,412 INFO L87 Difference]: Start difference. First operand 635 states and 894 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:10,495 INFO L93 Difference]: Finished difference Result 822 states and 1144 transitions. [2023-02-15 13:45:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:45:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2023-02-15 13:45:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:10,497 INFO L225 Difference]: With dead ends: 822 [2023-02-15 13:45:10,497 INFO L226 Difference]: Without dead ends: 718 [2023-02-15 13:45:10,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:10,498 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 111 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:10,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1051 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2023-02-15 13:45:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 656. [2023-02-15 13:45:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 581 states have (on average 1.3975903614457832) internal successors, (812), 591 states have internal predecessors, (812), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (56), 48 states have call predecessors, (56), 45 states have call successors, (56) [2023-02-15 13:45:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 917 transitions. [2023-02-15 13:45:10,532 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 917 transitions. Word has length 52 [2023-02-15 13:45:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:10,532 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 917 transitions. [2023-02-15 13:45:10,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 917 transitions. [2023-02-15 13:45:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:45:10,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:10,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:10,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:45:10,534 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:10,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1769180702, now seen corresponding path program 1 times [2023-02-15 13:45:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:10,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577649028] [2023-02-15 13:45:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:45:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 13:45:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 13:45:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:45:10,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577649028] [2023-02-15 13:45:10,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577649028] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:10,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490645382] [2023-02-15 13:45:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:10,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:45:10,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:10,722 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:45:10,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:45:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:10,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:45:10,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:11,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:45:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490645382] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:11,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:11,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2023-02-15 13:45:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831205903] [2023-02-15 13:45:11,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:45:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:45:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:45:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:45:11,400 INFO L87 Difference]: Start difference. First operand 656 states and 917 transitions. Second operand has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:45:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:13,202 INFO L93 Difference]: Finished difference Result 1726 states and 2424 transitions. [2023-02-15 13:45:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 13:45:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2023-02-15 13:45:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:13,207 INFO L225 Difference]: With dead ends: 1726 [2023-02-15 13:45:13,207 INFO L226 Difference]: Without dead ends: 1543 [2023-02-15 13:45:13,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2023-02-15 13:45:13,210 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 787 mSDsluCounter, 6469 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 6911 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:13,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 6911 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:45:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2023-02-15 13:45:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 705. [2023-02-15 13:45:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 625 states have (on average 1.392) internal successors, (870), 635 states have internal predecessors, (870), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 49 states have call successors, (60) [2023-02-15 13:45:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 983 transitions. [2023-02-15 13:45:13,257 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 983 transitions. Word has length 51 [2023-02-15 13:45:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:13,257 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 983 transitions. [2023-02-15 13:45:13,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 13:45:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 983 transitions. [2023-02-15 13:45:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:45:13,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:13,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:13,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:13,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:45:13,463 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2002153869, now seen corresponding path program 1 times [2023-02-15 13:45:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:45:13,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949927351] [2023-02-15 13:45:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:45:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:45:13,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:45:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:45:13,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 13:45:13,497 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:45:13,497 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 13:45:13,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 13:45:13,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 13:45:13,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 13:45:13,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 13:45:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 13:45:13,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 13:45:13,501 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:13,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:45:13,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:45:13 BoogieIcfgContainer [2023-02-15 13:45:13,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:45:13,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:45:13,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:45:13,543 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:45:13,544 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:53" (3/4) ... [2023-02-15 13:45:13,545 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 13:45:13,545 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:45:13,546 INFO L158 Benchmark]: Toolchain (without parser) took 20942.70ms. Allocated memory was 119.5MB in the beginning and 270.5MB in the end (delta: 151.0MB). Free memory was 81.9MB in the beginning and 105.0MB in the end (delta: -23.1MB). Peak memory consumption was 129.8MB. Max. memory is 16.1GB. [2023-02-15 13:45:13,546 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:13,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.86ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 68.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 13:45:13,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.40ms. Allocated memory is still 119.5MB. Free memory was 68.4MB in the beginning and 66.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:13,547 INFO L158 Benchmark]: Boogie Preprocessor took 19.74ms. Allocated memory is still 119.5MB. Free memory was 66.6MB in the beginning and 65.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:13,548 INFO L158 Benchmark]: RCFGBuilder took 545.80ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 65.1MB in the beginning and 123.9MB in the end (delta: -58.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:13,548 INFO L158 Benchmark]: TraceAbstraction took 20132.51ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 123.2MB in the beginning and 105.0MB in the end (delta: 18.2MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:13,548 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 270.5MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:13,556 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 119.5MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.86ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 68.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.40ms. Allocated memory is still 119.5MB. Free memory was 68.4MB in the beginning and 66.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.74ms. Allocated memory is still 119.5MB. Free memory was 66.6MB in the beginning and 65.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 545.80ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 65.1MB in the beginning and 123.9MB in the end (delta: -58.8MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20132.51ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 123.2MB in the beginning and 105.0MB in the end (delta: 18.2MB). Peak memory consumption was 133.1MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 270.5MB. Free memory is still 105.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: 109]: 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 108. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=-128] [L241] 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] [L241] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L241] zero = base2flt(0, 0) [L242] 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] [L242] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L242] a = base2flt(ma, ea) [L243] 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=-36028797002186751, __retres4=16777217, e=-128, m=16777217, res=16777217] [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=-36028797002186751, ea=-127, eb=-128, ma=16777216, mb=16777217, zero=0] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=16777217] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L101] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L109] (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: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 28, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6268 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6132 mSDsluCounter, 41166 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36600 mSDsCounter, 793 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8242 IncrementalHoareTripleChecker+Invalid, 9035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 793 mSolverCounterUnsat, 4566 mSDtfsCounter, 8242 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1330 GetRequests, 911 SyntacticMatches, 10 SemanticMatches, 409 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=27, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 4926 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1431 NumberOfCodeBlocks, 1431 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 6960 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1440 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 47 InterpolantComputations, 19 PerfectInterpolantSequences, 568/692 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 13:45:13,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:45:15,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:45:15,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:45:15,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:45:15,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:45:15,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:45:15,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:45:15,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:45:15,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:45:15,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:45:15,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:45:15,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:45:15,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:45:15,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:45:15,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:45:15,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:45:15,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:45:15,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:45:15,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:45:15,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:45:15,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:45:15,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:45:15,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:45:15,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:45:15,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:45:15,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:45:15,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:45:15,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:45:15,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:45:15,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:45:15,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:45:15,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:45:15,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:45:15,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:45:15,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:45:15,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:45:15,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:45:15,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:45:15,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:45:15,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:45:15,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:45:15,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 13:45:15,439 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:45:15,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:45:15,447 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:45:15,447 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:45:15,448 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:45:15,448 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:45:15,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:45:15,450 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:45:15,450 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:45:15,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 13:45:15,451 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:45:15,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 13:45:15,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:45:15,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:45:15,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:45:15,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:45:15,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:45:15,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:45:15,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:45:15,454 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:45:15,455 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:45:15,455 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2023-02-15 13:45:15,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:45:15,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:45:15,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:45:15,737 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:45:15,742 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:45:15,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-15 13:45:16,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:45:16,941 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:45:16,941 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2023-02-15 13:45:16,946 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85803fd6/750096962518499f8b60e8e77bb0200e/FLAGe4a776b9b [2023-02-15 13:45:16,959 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85803fd6/750096962518499f8b60e8e77bb0200e [2023-02-15 13:45:16,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:45:16,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:45:16,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:45:16,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:45:16,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:45:16,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:45:16" (1/1) ... [2023-02-15 13:45:16,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294ecf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:16, skipping insertion in model container [2023-02-15 13:45:16,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:45:16" (1/1) ... [2023-02-15 13:45:16,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:45:17,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:45:17,126 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2023-02-15 13:45:17,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:45:17,190 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:45:17,202 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2023-02-15 13:45:17,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:45:17,257 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:45:17,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17 WrapperNode [2023-02-15 13:45:17,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:45:17,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:45:17,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:45:17,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:45:17,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,296 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-02-15 13:45:17,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:45:17,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:45:17,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:45:17,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:45:17,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,338 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:45:17,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:45:17,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:45:17,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:45:17,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (1/1) ... [2023-02-15 13:45:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:45:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:45:17,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:45:17,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:45:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:45:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 13:45:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 13:45:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 13:45:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:45:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:45:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 13:45:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 13:45:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 13:45:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 13:45:17,537 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:45:17,539 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:45:17,773 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:45:17,793 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:45:17,793 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:45:17,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:17 BoogieIcfgContainer [2023-02-15 13:45:17,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:45:17,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:45:17,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:45:17,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:45:17,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:45:16" (1/3) ... [2023-02-15 13:45:17,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b76927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:45:17, skipping insertion in model container [2023-02-15 13:45:17,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:45:17" (2/3) ... [2023-02-15 13:45:17,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b76927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:45:17, skipping insertion in model container [2023-02-15 13:45:17,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:17" (3/3) ... [2023-02-15 13:45:17,799 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2023-02-15 13:45:17,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:45:17,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 13:45:17,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:45:17,874 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;@7bcd44bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:45:17,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 13:45:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 13:45:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:45:17,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:17,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:17,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 773389610, now seen corresponding path program 1 times [2023-02-15 13:45:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:17,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434934098] [2023-02-15 13:45:17,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:17,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:17,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:17,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:45:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:17,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 13:45:17,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:45:17,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:17,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:17,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434934098] [2023-02-15 13:45:17,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434934098] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:17,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:17,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 13:45:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590394932] [2023-02-15 13:45:17,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 13:45:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 13:45:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:45:18,007 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 71 states have internal predecessors, (89), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:45:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:18,064 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2023-02-15 13:45:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 13:45:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:45:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:18,071 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:45:18,071 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 13:45:18,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 13:45:18,080 INFO L413 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:18,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 13:45:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-15 13:45:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 54 states have internal predecessors, (65), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2023-02-15 13:45:18,110 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 9 [2023-02-15 13:45:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:18,111 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2023-02-15 13:45:18,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:45:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2023-02-15 13:45:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:45:18,112 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:18,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:18,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:18,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:18,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 772448344, now seen corresponding path program 1 times [2023-02-15 13:45:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:18,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634272076] [2023-02-15 13:45:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:18,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:18,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:45:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:18,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:45:18,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:45:18,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:18,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:18,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634272076] [2023-02-15 13:45:18,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634272076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:18,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:18,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:45:18,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799741665] [2023-02-15 13:45:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:18,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:18,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:18,399 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:45:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:18,468 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2023-02-15 13:45:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:18,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 13:45:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:18,471 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:45:18,471 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 13:45:18,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:45:18,472 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:18,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 218 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 13:45:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 13:45:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 58 states have internal predecessors, (69), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2023-02-15 13:45:18,480 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 9 [2023-02-15 13:45:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:18,481 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2023-02-15 13:45:18,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:45:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2023-02-15 13:45:18,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:45:18,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:18,481 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:18,492 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 (3)] Ended with exit code 0 [2023-02-15 13:45:18,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:18,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:18,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1921948498, now seen corresponding path program 1 times [2023-02-15 13:45:18,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:18,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012613272] [2023-02-15 13:45:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:18,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:18,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:18,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:45:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:18,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:18,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:45:18,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:18,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:18,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012613272] [2023-02-15 13:45:18,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012613272] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:18,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:18,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091414926] [2023-02-15 13:45:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:18,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:18,778 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:18,799 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-15 13:45:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:18,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 13:45:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:18,800 INFO L225 Difference]: With dead ends: 73 [2023-02-15 13:45:18,800 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 13:45:18,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:18,801 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:18,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 149 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 13:45:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-15 13:45:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 57 states have internal predecessors, (68), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2023-02-15 13:45:18,808 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 16 [2023-02-15 13:45:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:18,808 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2023-02-15 13:45:18,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2023-02-15 13:45:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:45:18,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:18,809 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:18,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-15 13:45:19,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:19,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash 730880598, now seen corresponding path program 1 times [2023-02-15 13:45:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540696592] [2023-02-15 13:45:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:19,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:19,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:19,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:45:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:19,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:19,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:45:19,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:19,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:19,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540696592] [2023-02-15 13:45:19,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540696592] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:19,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:19,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909595353] [2023-02-15 13:45:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:19,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:19,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:19,082 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:19,100 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2023-02-15 13:45:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 13:45:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:19,101 INFO L225 Difference]: With dead ends: 72 [2023-02-15 13:45:19,101 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 13:45:19,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:19,102 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:19,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 13:45:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-15 13:45:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2023-02-15 13:45:19,108 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 18 [2023-02-15 13:45:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:19,108 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2023-02-15 13:45:19,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2023-02-15 13:45:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:45:19,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:19,109 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:19,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:19,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 730948124, now seen corresponding path program 1 times [2023-02-15 13:45:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:19,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467014679] [2023-02-15 13:45:19,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:19,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:19,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:19,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:45:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:19,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:45:19,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:45:19,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:19,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:19,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467014679] [2023-02-15 13:45:19,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467014679] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:19,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:19,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:45:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187002776] [2023-02-15 13:45:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:19,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:19,396 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:19,614 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2023-02-15 13:45:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:19,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 13:45:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:19,615 INFO L225 Difference]: With dead ends: 84 [2023-02-15 13:45:19,615 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:45:19,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:45:19,616 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:19,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:45:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:45:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-15 13:45:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 61 states have internal predecessors, (73), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-02-15 13:45:19,622 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 18 [2023-02-15 13:45:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:19,623 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-02-15 13:45:19,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-02-15 13:45:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:45:19,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:19,624 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:19,641 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:45:19,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,830 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 33110864, now seen corresponding path program 1 times [2023-02-15 13:45:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:19,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485926487] [2023-02-15 13:45:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:19,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:19,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:19,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:19,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:45:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:19,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:45:19,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:45:20,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:20,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:20,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485926487] [2023-02-15 13:45:20,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485926487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:20,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:20,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:45:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233594954] [2023-02-15 13:45:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:45:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:20,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:45:20,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:45:20,349 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:22,181 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2023-02-15 13:45:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:45:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 13:45:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:22,182 INFO L225 Difference]: With dead ends: 89 [2023-02-15 13:45:22,183 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 13:45:22,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:22,183 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:22,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 304 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 13:45:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 13:45:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-15 13:45:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 55 states have internal predecessors, (66), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 13:45:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2023-02-15 13:45:22,195 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 21 [2023-02-15 13:45:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:22,195 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2023-02-15 13:45:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:45:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2023-02-15 13:45:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:45:22,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:22,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:22,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:22,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:22,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:22,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1763431449, now seen corresponding path program 1 times [2023-02-15 13:45:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:22,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177532033] [2023-02-15 13:45:22,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:22,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:22,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:45:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:22,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:22,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:22,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:22,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177532033] [2023-02-15 13:45:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177532033] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:22,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:22,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:45:22,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137188845] [2023-02-15 13:45:22,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:22,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:22,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:22,494 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:22,560 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2023-02-15 13:45:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:45:22,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-02-15 13:45:22,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:22,561 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:45:22,561 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:45:22,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:22,562 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:22,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 479 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:45:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-15 13:45:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 64 states have internal predecessors, (74), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 13:45:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2023-02-15 13:45:22,569 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 37 [2023-02-15 13:45:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:22,570 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2023-02-15 13:45:22,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2023-02-15 13:45:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:45:22,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:22,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:22,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:22,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:22,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:22,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:22,778 INFO L85 PathProgramCache]: Analyzing trace with hash -184106620, now seen corresponding path program 1 times [2023-02-15 13:45:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:22,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882942032] [2023-02-15 13:45:22,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:22,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:22,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:22,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:22,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:45:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:22,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:22,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:22,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:22,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882942032] [2023-02-15 13:45:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882942032] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:22,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:22,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 13:45:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224617290] [2023-02-15 13:45:22,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:22,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:45:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:45:22,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:45:22,913 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:22,975 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-15 13:45:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:45:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2023-02-15 13:45:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:22,976 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:45:22,976 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 13:45:22,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:22,977 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:22,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 526 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 13:45:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-02-15 13:45:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 66 states have internal predecessors, (76), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-15 13:45:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2023-02-15 13:45:22,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2023-02-15 13:45:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:22,986 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2023-02-15 13:45:22,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2023-02-15 13:45:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:45:22,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:22,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:22,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:23,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:23,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1036359320, now seen corresponding path program 1 times [2023-02-15 13:45:23,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:23,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021204061] [2023-02-15 13:45:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:23,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:23,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:23,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:23,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:45:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:23,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:23,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:23,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:45:23,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:23,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021204061] [2023-02-15 13:45:23,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021204061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:23,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:23,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-15 13:45:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178487791] [2023-02-15 13:45:23,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:23,332 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:45:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:23,413 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2023-02-15 13:45:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2023-02-15 13:45:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:23,416 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:45:23,416 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 13:45:23,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:45:23,418 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:23,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 606 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 13:45:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-15 13:45:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 64 states have internal predecessors, (74), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 13:45:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-15 13:45:23,434 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 41 [2023-02-15 13:45:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:23,435 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-15 13:45:23,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 13:45:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-15 13:45:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:45:23,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:23,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:23,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:23,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:23,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1099402567, now seen corresponding path program 2 times [2023-02-15 13:45:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957755504] [2023-02-15 13:45:23,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:45:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:23,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:23,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 13:45:23,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 13:45:23,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:45:23,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:23,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:45:23,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:23,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:23,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957755504] [2023-02-15 13:45:23,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957755504] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:23,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:23,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:45:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685269375] [2023-02-15 13:45:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:23,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:23,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:23,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:23,744 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:23,992 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2023-02-15 13:45:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:45:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-02-15 13:45:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:23,994 INFO L225 Difference]: With dead ends: 169 [2023-02-15 13:45:23,994 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:45:23,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:45:23,994 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 77 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:23,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 866 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:45:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:45:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2023-02-15 13:45:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 87 states have internal predecessors, (101), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-02-15 13:45:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2023-02-15 13:45:24,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 45 [2023-02-15 13:45:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:24,003 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2023-02-15 13:45:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2023-02-15 13:45:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:24,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:24,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:24,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-15 13:45:24,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:24,211 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -278258631, now seen corresponding path program 1 times [2023-02-15 13:45:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:24,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266096782] [2023-02-15 13:45:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:24,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:24,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:24,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:24,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 13:45:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:24,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:45:24,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:45:24,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:24,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:24,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266096782] [2023-02-15 13:45:24,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266096782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:24,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:24,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:45:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739940319] [2023-02-15 13:45:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:45:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:45:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:24,327 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:45:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:24,439 INFO L93 Difference]: Finished difference Result 222 states and 277 transitions. [2023-02-15 13:45:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:24,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 13:45:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:24,440 INFO L225 Difference]: With dead ends: 222 [2023-02-15 13:45:24,441 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 13:45:24,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:45:24,441 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:24,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 864 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:24,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 13:45:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2023-02-15 13:45:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.225) internal successors, (147), 125 states have internal predecessors, (147), 22 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (25), 21 states have call predecessors, (25), 20 states have call successors, (25) [2023-02-15 13:45:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 194 transitions. [2023-02-15 13:45:24,451 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 194 transitions. Word has length 46 [2023-02-15 13:45:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:24,451 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 194 transitions. [2023-02-15 13:45:24,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:45:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 194 transitions. [2023-02-15 13:45:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:45:24,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:24,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:24,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:24,661 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -865064645, now seen corresponding path program 1 times [2023-02-15 13:45:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:24,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448040002] [2023-02-15 13:45:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:24,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:24,663 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:24,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 13:45:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:24,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:45:24,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:24,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:45:24,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:24,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:24,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448040002] [2023-02-15 13:45:24,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448040002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:24,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:24,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:45:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043239135] [2023-02-15 13:45:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:24,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:45:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:45:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:45:24,805 INFO L87 Difference]: Start difference. First operand 155 states and 194 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:45:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:24,988 INFO L93 Difference]: Finished difference Result 173 states and 210 transitions. [2023-02-15 13:45:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:45:24,988 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 13:45:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:24,989 INFO L225 Difference]: With dead ends: 173 [2023-02-15 13:45:24,989 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 13:45:24,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:45:24,990 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 67 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:24,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 730 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 13:45:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-02-15 13:45:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-15 13:45:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2023-02-15 13:45:24,997 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 46 [2023-02-15 13:45:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:24,997 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2023-02-15 13:45:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:45:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2023-02-15 13:45:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:45:24,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:24,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:25,007 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 (13)] Ended with exit code 0 [2023-02-15 13:45:25,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:25,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1835217457, now seen corresponding path program 1 times [2023-02-15 13:45:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:25,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501775612] [2023-02-15 13:45:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:25,206 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:25,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 13:45:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:25,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:45:25,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:25,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:45:25,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:25,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501775612] [2023-02-15 13:45:25,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501775612] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:25,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:25,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-02-15 13:45:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057635845] [2023-02-15 13:45:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:25,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:45:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:45:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:45:25,387 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:25,458 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2023-02-15 13:45:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:25,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-15 13:45:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:25,459 INFO L225 Difference]: With dead ends: 114 [2023-02-15 13:45:25,459 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:45:25,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:45:25,460 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 18 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:25,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 234 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:45:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-02-15 13:45:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 87 states have internal predecessors, (101), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-15 13:45:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 132 transitions. [2023-02-15 13:45:25,466 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 132 transitions. Word has length 47 [2023-02-15 13:45:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:25,467 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 132 transitions. [2023-02-15 13:45:25,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 13:45:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 132 transitions. [2023-02-15 13:45:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:45:25,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:25,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:25,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:25,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:25,674 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1057166479, now seen corresponding path program 1 times [2023-02-15 13:45:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:25,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961797239] [2023-02-15 13:45:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:25,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:25,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:25,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:25,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:45:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:25,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:45:25,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 13:45:25,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 13:45:25,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:25,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961797239] [2023-02-15 13:45:25,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961797239] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:25,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:45:25,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2023-02-15 13:45:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176103780] [2023-02-15 13:45:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:25,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:45:25,862 INFO L87 Difference]: Start difference. First operand 107 states and 132 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:25,944 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2023-02-15 13:45:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:45:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2023-02-15 13:45:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:25,946 INFO L225 Difference]: With dead ends: 121 [2023-02-15 13:45:25,946 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:45:25,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:45:25,946 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:25,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 177 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:45:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2023-02-15 13:45:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 86 states have internal predecessors, (99), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-15 13:45:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2023-02-15 13:45:25,953 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 48 [2023-02-15 13:45:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:25,953 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2023-02-15 13:45:25,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:45:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2023-02-15 13:45:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:45:25,954 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:25,954 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:25,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:26,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:26,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 476613900, now seen corresponding path program 1 times [2023-02-15 13:45:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:26,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037533030] [2023-02-15 13:45:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:26,163 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:26,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 13:45:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:26,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:45:26,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:45:26,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:26,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037533030] [2023-02-15 13:45:26,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037533030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:45:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1081126519] [2023-02-15 13:45:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:26,485 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:45:26,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:45:26,487 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 13:45:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-02-15 13:45:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:26,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:45:26,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 13:45:26,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 13:45:26,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1081126519] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:26,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:45:26,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 14 [2023-02-15 13:45:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590891185] [2023-02-15 13:45:26,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:26,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:45:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:45:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:45:26,582 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 13:45:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:26,865 INFO L93 Difference]: Finished difference Result 188 states and 230 transitions. [2023-02-15 13:45:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:45:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2023-02-15 13:45:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:26,866 INFO L225 Difference]: With dead ends: 188 [2023-02-15 13:45:26,866 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:45:26,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:45:26,867 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 65 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:26,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1007 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:45:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:45:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2023-02-15 13:45:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 110 states have internal predecessors, (128), 19 states have call successors, (19), 7 states have call predecessors, (19), 9 states have return successors, (22), 18 states have call predecessors, (22), 18 states have call successors, (22) [2023-02-15 13:45:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2023-02-15 13:45:26,874 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 59 [2023-02-15 13:45:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:26,875 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2023-02-15 13:45:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 13:45:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2023-02-15 13:45:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 13:45:26,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:26,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:26,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:27,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2023-02-15 13:45:27,282 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 13:45:27,283 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1914867570, now seen corresponding path program 1 times [2023-02-15 13:45:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:27,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038002429] [2023-02-15 13:45:27,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:27,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:27,285 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:45:27,287 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:45:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:27,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:45:27,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 13:45:27,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:27,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:27,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038002429] [2023-02-15 13:45:27,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038002429] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:27,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:27,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:45:27,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765534701] [2023-02-15 13:45:27,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:27,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:27,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:27,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:27,369 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:27,445 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2023-02-15 13:45:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2023-02-15 13:45:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:27,446 INFO L225 Difference]: With dead ends: 184 [2023-02-15 13:45:27,446 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:45:27,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:45:27,447 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:27,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 568 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:45:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:45:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2023-02-15 13:45:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 101 states have internal predecessors, (118), 18 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-02-15 13:45:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2023-02-15 13:45:27,454 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 61 [2023-02-15 13:45:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:27,454 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2023-02-15 13:45:27,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2023-02-15 13:45:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 13:45:27,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:27,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:27,477 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:45:27,662 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:45:27,662 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1482705623, now seen corresponding path program 1 times [2023-02-15 13:45:27,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:27,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797121061] [2023-02-15 13:45:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:27,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:27,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:27,664 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:27,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 13:45:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:27,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:45:27,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:45:27,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:45:27,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:27,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797121061] [2023-02-15 13:45:27,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797121061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:27,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:27,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 13:45:27,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262221654] [2023-02-15 13:45:27,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:27,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:45:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:45:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:45:27,800 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:45:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:27,915 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2023-02-15 13:45:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:45:27,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2023-02-15 13:45:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:27,916 INFO L225 Difference]: With dead ends: 219 [2023-02-15 13:45:27,916 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 13:45:27,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:45:27,917 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:27,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 623 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 13:45:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-02-15 13:45:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 102 states have internal predecessors, (118), 18 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2023-02-15 13:45:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2023-02-15 13:45:27,924 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 67 [2023-02-15 13:45:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:27,924 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2023-02-15 13:45:27,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 13:45:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2023-02-15 13:45:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 13:45:27,925 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:27,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:27,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:28,133 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:28,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1594801001, now seen corresponding path program 1 times [2023-02-15 13:45:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:28,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610348473] [2023-02-15 13:45:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:28,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:28,135 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:28,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 13:45:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:28,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:45:28,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 13:45:28,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 13:45:28,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610348473] [2023-02-15 13:45:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610348473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:28,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:28,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-15 13:45:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868238359] [2023-02-15 13:45:28,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:28,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 13:45:28,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 13:45:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:45:28,415 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-15 13:45:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:28,762 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2023-02-15 13:45:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:45:28,763 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 67 [2023-02-15 13:45:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:28,763 INFO L225 Difference]: With dead ends: 237 [2023-02-15 13:45:28,763 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 13:45:28,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:45:28,764 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 201 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:28,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1123 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:45:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 13:45:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2023-02-15 13:45:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 122 states have internal predecessors, (139), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-15 13:45:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 184 transitions. [2023-02-15 13:45:28,780 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 184 transitions. Word has length 67 [2023-02-15 13:45:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 184 transitions. [2023-02-15 13:45:28,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 14 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2023-02-15 13:45:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 184 transitions. [2023-02-15 13:45:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 13:45:28,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:28,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:28,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:28,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:28,989 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 522989730, now seen corresponding path program 1 times [2023-02-15 13:45:28,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:28,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742013907] [2023-02-15 13:45:28,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:28,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:28,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:28,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 13:45:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:29,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 13:45:29,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 13:45:29,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:29,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742013907] [2023-02-15 13:45:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742013907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:29,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:29,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:45:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842633410] [2023-02-15 13:45:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:45:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:45:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:29,065 INFO L87 Difference]: Start difference. First operand 151 states and 184 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 13:45:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:29,214 INFO L93 Difference]: Finished difference Result 166 states and 201 transitions. [2023-02-15 13:45:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:45:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-02-15 13:45:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:29,215 INFO L225 Difference]: With dead ends: 166 [2023-02-15 13:45:29,215 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 13:45:29,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:45:29,216 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:29,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 13:45:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2023-02-15 13:45:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 122 states have (on average 1.139344262295082) internal successors, (139), 124 states have internal predecessors, (139), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (24), 22 states have call predecessors, (24), 21 states have call successors, (24) [2023-02-15 13:45:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2023-02-15 13:45:29,224 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 61 [2023-02-15 13:45:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:29,225 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2023-02-15 13:45:29,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 13:45:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2023-02-15 13:45:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-15 13:45:29,225 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:29,226 INFO L195 NwaCegarLoop]: trace histogram [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, 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:29,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:29,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:29,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:29,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1788417681, now seen corresponding path program 1 times [2023-02-15 13:45:29,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:29,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589450593] [2023-02-15 13:45:29,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:29,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:29,435 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:45:29,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 13:45:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:29,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:45:29,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 13:45:29,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:45:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 13:45:29,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:29,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589450593] [2023-02-15 13:45:29,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589450593] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:45:29,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:45:29,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 13:45:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275529004] [2023-02-15 13:45:29,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:45:29,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:45:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:45:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:45:29,629 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 13:45:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:29,758 INFO L93 Difference]: Finished difference Result 204 states and 242 transitions. [2023-02-15 13:45:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:45:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 67 [2023-02-15 13:45:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:29,759 INFO L225 Difference]: With dead ends: 204 [2023-02-15 13:45:29,759 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:45:29,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:45:29,760 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:29,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 921 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:45:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:45:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2023-02-15 13:45:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.1282051282051282) internal successors, (132), 119 states have internal predecessors, (132), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2023-02-15 13:45:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2023-02-15 13:45:29,768 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 67 [2023-02-15 13:45:29,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:29,768 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2023-02-15 13:45:29,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 11 states have internal predecessors, (54), 5 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 13:45:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2023-02-15 13:45:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 13:45:29,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:45:29,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:29,778 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 (22)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:29,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:29,976 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 13:45:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:45:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1556235369, now seen corresponding path program 1 times [2023-02-15 13:45:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:45:29,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750985057] [2023-02-15 13:45:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:45:29,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:45:29,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:45:29,978 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:45:29,980 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:45:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:45:30,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:45:30,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:45:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-15 13:45:30,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:45:30,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:45:30,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750985057] [2023-02-15 13:45:30,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750985057] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:45:30,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:45:30,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:45:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241513210] [2023-02-15 13:45:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:45:30,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:45:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:45:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:45:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:45:30,074 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:45:30,550 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2023-02-15 13:45:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:45:30,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2023-02-15 13:45:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:45:30,551 INFO L225 Difference]: With dead ends: 160 [2023-02-15 13:45:30,552 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 13:45:30,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:45:30,552 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:45:30,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 192 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:45:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 13:45:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 13:45:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:45:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 13:45:30,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-02-15 13:45:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:45:30,553 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 13:45:30,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:45:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 13:45:30,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 13:45:30,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 13:45:30,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 13:45:30,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 13:45:30,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 13:45:30,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 13:45:30,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 13:45:30,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 13:45:30,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 13:45:30,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 13:45:30,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 13:45:30,567 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 (23)] Forceful destruction successful, exit code 0 [2023-02-15 13:45:30,761 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:45:30,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 13:45:36,432 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 13:45:36,432 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 13:45:36,432 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 13:45:36,432 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L895 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:36,433 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32))) .cse0))) [2023-02-15 13:45:36,433 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-15 13:45:36,433 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (or (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))) .cse0) (or (not (= |base2flt_#in~m| (_ bv0 32))) .cse0))) [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 254) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L244-1(line 244) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L902 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: true [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 225 263) the Hoare annotation is: true [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 13:45:36,434 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 256) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L902 garLoopResultBuilder]: At program point L245(line 245) the Hoare annotation is: true [2023-02-15 13:45:36,435 INFO L902 garLoopResultBuilder]: At program point L247-2(lines 247 256) the Hoare annotation is: true [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point L245-1(line 245) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L902 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: true [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point L243-1(line 243) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L902 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: true [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 137) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L895 garLoopResultBuilder]: At program point L126-2(lines 126 137) the Hoare annotation is: (let ((.cse3 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse1 (= addflt_~a |addflt_#in~a|)) (.cse0 (= |addflt_#in~b| (_ bv0 32))) (.cse8 (bvadd (bvneg ((_ sign_extend 1) addflt_~eb~0)) ((_ sign_extend 1) addflt_~ea~0))) (.cse2 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse9 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (not .cse0) (or .cse1 (bvult |addflt_#in~a| |addflt_#in~b|)) (or .cse2 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|) .cse3)) (let ((.cse4 (let ((.cse5 (not (bvult addflt_~a addflt_~b))) (.cse6 (or .cse0 (not (= addflt_~b (_ bv0 32))))) (.cse7 (bvsle (_ bv6442450944 33) .cse8))) (or (and (= addflt_~b |addflt_#in~a|) .cse5 .cse6 .cse7) (and .cse1 .cse5 .cse6 .cse7))))) (or (and .cse4 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32))))) (and .cse4 .cse3))) (or (and (bvsle .cse8 (_ bv2147483647 33)) (= addflt_~ea~0 (_ bv127 32)) (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) .cse9) (or .cse2 .cse9 (= addflt_~eb~0 (_ bv127 32))))) [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point addfltFINAL(lines 83 147) no Hoare annotation was computed. [2023-02-15 13:45:36,435 INFO L899 garLoopResultBuilder]: For program point addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L895 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (let ((.cse1 (= addflt_~a |addflt_#in~a|)) (.cse0 (= |addflt_#in~b| (_ bv0 32))) (.cse6 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse2 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (not .cse0) (or .cse1 (bvult |addflt_#in~a| |addflt_#in~b|)) (or (and (= addflt_~ea~0 (_ bv127 32)) (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) .cse2) (let ((.cse3 (bvsle (bvadd (bvneg ((_ sign_extend 1) addflt_~eb~0)) ((_ sign_extend 1) addflt_~ea~0)) (_ bv2147483647 33))) (.cse4 (not (bvult addflt_~a addflt_~b))) (.cse5 (or .cse0 (not (= addflt_~b (_ bv0 32)))))) (or (and .cse3 .cse1 .cse4 .cse5) (and .cse3 (= addflt_~b |addflt_#in~a|) .cse4 .cse5))) (or .cse6 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|))) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))) (or .cse6 .cse2 (= addflt_~eb~0 (_ bv127 32))))) [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L114-1(line 114) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 132) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 112) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L94-2(lines 93 146) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 133) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L895 garLoopResultBuilder]: At program point L144(lines 93 146) the Hoare annotation is: (let ((.cse4 (= addflt_~b (_ bv0 32))) (.cse3 (= |addflt_#in~a| (_ bv0 32)))) (let ((.cse5 (= addflt_~b |addflt_#in~b|)) (.cse7 (or (not .cse4) .cse3)) (.cse1 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse9 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse8 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse10 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (let ((.cse2 (= addflt_~b |addflt_#in~a|))) (let ((.cse0 (let ((.cse6 (not (bvult addflt_~a addflt_~b)))) (or (and .cse2 .cse6) (and (= addflt_~a |addflt_#in~a|) .cse6 .cse7))))) (or (and .cse0 .cse1) (and (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32)))) .cse0) (and .cse2 .cse3) (and .cse4 .cse5)))) (or .cse8 (and (= addflt_~ea~0 (_ bv127 32)) .cse5 .cse7) (and .cse9 .cse4)) (or (and .cse9 .cse1) .cse10 (and .cse9 .cse3)) (or (not (= |addflt_#in~b| (_ bv0 32))) .cse4) (or .cse8 .cse10 (= addflt_~eb~0 (_ bv127 32)))))) [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L895 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: (let ((.cse1 (= addflt_~a |addflt_#in~a|)) (.cse0 (= |addflt_#in~b| (_ bv0 32))) (.cse3 (not (= (_ bv0 32) (bvadd |addflt_#in~a| (_ bv1 32))))) (.cse2 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (not .cse0) (or .cse1 (bvult |addflt_#in~a| |addflt_#in~b|)) (or (and (= addflt_~ea~0 (_ bv127 32)) (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) .cse2) (or .cse3 (and (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|))) (let ((.cse8 (bvadd (bvneg ((_ sign_extend 1) addflt_~eb~0)) ((_ sign_extend 1) addflt_~ea~0)))) (let ((.cse4 (bvsle .cse8 (_ bv2147483647 33))) (.cse5 (not (bvult addflt_~a addflt_~b))) (.cse6 (or .cse0 (not (= addflt_~b (_ bv0 32))))) (.cse7 (bvsle (_ bv6442450944 33) .cse8))) (or (and .cse4 (= addflt_~b |addflt_#in~a|) .cse5 .cse6 .cse7) (and .cse4 .cse1 .cse5 .cse6 .cse7)))) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))) (or .cse3 .cse2 (= addflt_~eb~0 (_ bv127 32))))) [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-02-15 13:45:36,436 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L112-1(line 112) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L141-1(line 141) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 83 147) the Hoare annotation is: true [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L133-1(line 133) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 109) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point addfltEXIT(lines 83 147) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 115) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-15 13:45:36,437 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-15 13:45:36,439 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:45:36,441 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:45:36,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,459 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,460 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,463 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,464 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,465 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,466 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,467 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,468 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,469 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,470 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:45:36 BoogieIcfgContainer [2023-02-15 13:45:36,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:45:36,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:45:36,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:45:36,471 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:45:36,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:45:17" (3/4) ... [2023-02-15 13:45:36,474 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 13:45:36,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 13:45:36,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2023-02-15 13:45:36,478 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 13:45:36,481 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-15 13:45:36,481 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 13:45:36,482 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 13:45:36,482 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 13:45:36,496 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:36,499 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:36,499 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:36,500 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) [2023-02-15 13:45:36,500 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((b == \old(a) && !~bvult64(a, b)) || ((a == \old(a) && !~bvult64(a, b)) && (!(b == 0bv32) || \old(a) == 0bv32))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) || ((\exists addflt_~a : bv32 :: ~bvadd128(ea, 127bv32) == ~bvlshr64(addflt_~a, 24bv32)) && ((b == \old(a) && !~bvult64(a, b)) || ((a == \old(a) && !~bvult64(a, b)) && (!(b == 0bv32) || \old(a) == 0bv32))))) || (b == \old(a) && \old(a) == 0bv32)) || (b == 0bv32 && b == \old(b))) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || ((ea == 127bv32 && b == \old(b)) && (!(b == 0bv32) || \old(a) == 0bv32))) || (~bvadd128(a, 1bv32) == 0bv32 && b == 0bv32))) && (((~bvadd128(a, 1bv32) == 0bv32 && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || (~bvadd128(a, 1bv32) == 0bv32 && \old(a) == 0bv32))) && (!(\old(b) == 0bv32) || b == 0bv32)) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || eb == 127bv32) [2023-02-15 13:45:36,515 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:45:36,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:45:36,516 INFO L158 Benchmark]: Toolchain (without parser) took 19554.65ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 43.6MB in the beginning and 25.2MB in the end (delta: 18.3MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,516 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 67.1MB. Free memory was 44.3MB in the beginning and 44.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:45:36,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.4MB in the beginning and 60.1MB in the end (delta: -16.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.70ms. Allocated memory is still 81.8MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,517 INFO L158 Benchmark]: Boogie Preprocessor took 46.96ms. Allocated memory is still 81.8MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,517 INFO L158 Benchmark]: RCFGBuilder took 449.58ms. Allocated memory is still 81.8MB. Free memory was 56.9MB in the beginning and 40.4MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,517 INFO L158 Benchmark]: TraceAbstraction took 18674.87ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 39.8MB in the beginning and 30.4MB in the end (delta: 9.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,518 INFO L158 Benchmark]: Witness Printer took 44.90ms. Allocated memory is still 100.7MB. Free memory was 29.4MB in the beginning and 25.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 13:45:36,519 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.30ms. Allocated memory is still 67.1MB. Free memory was 44.3MB in the beginning and 44.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.04ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 43.4MB in the beginning and 60.1MB in the end (delta: -16.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.70ms. Allocated memory is still 81.8MB. Free memory was 60.1MB in the beginning and 58.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.96ms. Allocated memory is still 81.8MB. Free memory was 58.4MB in the beginning and 56.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.58ms. Allocated memory is still 81.8MB. Free memory was 56.9MB in the beginning and 40.4MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18674.87ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 39.8MB in the beginning and 30.4MB in the end (delta: 9.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * Witness Printer took 44.90ms. Allocated memory is still 100.7MB. Free memory was 29.4MB in the beginning and 25.2MB 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[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - 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: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 865 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 843 mSDsluCounter, 10120 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8355 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2298 IncrementalHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 1765 mSDtfsCounter, 2298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 1253 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=11, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 254 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 231 PreInvPairs, 400 NumberOfFragments, 725 HoareAnnotationTreeSize, 231 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 28331 FormulaSimplificationTreeSizeReductionInter, 5.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 956 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1367 ConstructedInterpolants, 47 QuantifiedInterpolants, 2657 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1808 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 485/524 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant [2023-02-15 13:45:36,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 28]: Loop Invariant [2023-02-15 13:45:36,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,535 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && ((!(\old(m) == 0bv32) || (m == 0bv32 && __retres4 == 0bv32)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 93]: Loop Invariant [2023-02-15 13:45:36,536 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 13:45:36,537 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: (((((((((b == \old(a) && !~bvult64(a, b)) || ((a == \old(a) && !~bvult64(a, b)) && (!(b == 0bv32) || \old(a) == 0bv32))) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) || ((\exists addflt_~a : bv32 :: ~bvadd128(ea, 127bv32) == ~bvlshr64(addflt_~a, 24bv32)) && ((b == \old(a) && !~bvult64(a, b)) || ((a == \old(a) && !~bvult64(a, b)) && (!(b == 0bv32) || \old(a) == 0bv32))))) || (b == \old(a) && \old(a) == 0bv32)) || (b == 0bv32 && b == \old(b))) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || ((ea == 127bv32 && b == \old(b)) && (!(b == 0bv32) || \old(a) == 0bv32))) || (~bvadd128(a, 1bv32) == 0bv32 && b == 0bv32))) && (((~bvadd128(a, 1bv32) == 0bv32 && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || (~bvadd128(a, 1bv32) == 0bv32 && \old(a) == 0bv32))) && (!(\old(b) == 0bv32) || b == 0bv32)) && ((!(0bv32 == ~bvadd128(\old(a), 1bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32)) || eb == 127bv32) - InvariantResult [Line: 37]: Loop Invariant [2023-02-15 13:45:36,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,538 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) - InvariantResult [Line: 57]: Loop Invariant [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,539 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,540 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 13:45:36,540 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) && (!(\old(m) == 0bv32) || (forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2)))) RESULT: Ultimate proved your program to be correct! [2023-02-15 13:45:36,565 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