./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:45:23,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:45:23,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:45:23,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:45:23,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:45:23,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:45:23,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:45:23,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:45:23,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:45:23,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:45:23,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:45:23,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:45:23,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:45:23,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:45:23,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:45:23,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:45:23,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:45:23,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:45:23,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:45:23,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:45:23,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:45:23,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:45:23,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:45:23,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:45:23,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:45:23,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:45:23,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:45:23,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:45:23,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:45:23,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:45:23,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:45:23,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:45:23,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:45:23,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:45:23,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:45:23,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:45:23,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:45:23,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:45:23,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:45:23,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:45:23,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:45:23,236 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 22:45:23,263 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:45:23,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:45:23,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:45:23,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:45:23,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:45:23,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:45:23,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:45:23,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:45:23,265 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:45:23,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:45:23,266 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:45:23,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:45:23,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:45:23,267 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:45:23,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:45:23,268 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:45:23,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:45:23,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:45:23,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:45:23,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:45:23,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:23,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:45:23,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:45:23,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:45:23,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:45:23,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:45:23,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:45:23,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:45:23,270 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:45:23,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:45:23,270 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:45:23,271 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-15 22:45:23,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:45:23,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:45:23,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:45:23,418 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:45:23,419 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:45:23,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 22:45:24,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:45:24,553 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:45:24,553 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 22:45:24,561 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a73d2b7/23c824ea1ecd4067a1af552055c5b35d/FLAGa597a8dee [2023-02-15 22:45:24,574 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a73d2b7/23c824ea1ecd4067a1af552055c5b35d [2023-02-15 22:45:24,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:45:24,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:45:24,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:24,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:45:24,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:45:24,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226e51d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24, skipping insertion in model container [2023-02-15 22:45:24,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:45:24,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:45:24,713 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c[728,741] [2023-02-15 22:45:24,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:24,751 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:45:24,759 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c[728,741] [2023-02-15 22:45:24,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:24,826 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:45:24,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24 WrapperNode [2023-02-15 22:45:24,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:24,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:24,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:45:24,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:45:24,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,885 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2023-02-15 22:45:24,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:24,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:45:24,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:45:24,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:45:24,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,904 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:45:24,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:45:24,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:45:24,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:45:24,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (1/1) ... [2023-02-15 22:45:24,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:24,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:24,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:45:24,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:45:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:45:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:45:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:45:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:45:24,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:45:24,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:45:24,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:45:24,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:45:25,041 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:45:25,042 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:45:25,379 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:45:25,384 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:45:25,384 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:45:25,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:25 BoogieIcfgContainer [2023-02-15 22:45:25,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:45:25,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:45:25,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:45:25,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:45:25,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:45:24" (1/3) ... [2023-02-15 22:45:25,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9cf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:25, skipping insertion in model container [2023-02-15 22:45:25,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:24" (2/3) ... [2023-02-15 22:45:25,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d9cf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:25, skipping insertion in model container [2023-02-15 22:45:25,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:25" (3/3) ... [2023-02-15 22:45:25,392 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-15 22:45:25,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:45:25,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-15 22:45:25,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:45:25,443 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;@40742480, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:45:25,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-15 22:45:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:45:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:45:25,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:25,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:25,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash 186900082, now seen corresponding path program 1 times [2023-02-15 22:45:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972805123] [2023-02-15 22:45:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:25,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972805123] [2023-02-15 22:45:25,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972805123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:25,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:25,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53889213] [2023-02-15 22:45:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:25,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:25,688 INFO L87 Difference]: Start difference. First operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:25,799 INFO L93 Difference]: Finished difference Result 263 states and 382 transitions. [2023-02-15 22:45:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:25,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:45:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:25,808 INFO L225 Difference]: With dead ends: 263 [2023-02-15 22:45:25,808 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 22:45:25,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:25,813 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:25,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 22:45:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-02-15 22:45:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 118 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2023-02-15 22:45:25,855 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 9 [2023-02-15 22:45:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:25,856 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2023-02-15 22:45:25,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2023-02-15 22:45:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:45:25,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:25,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:25,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:45:25,858 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:25,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash 207635630, now seen corresponding path program 1 times [2023-02-15 22:45:25,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:25,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278497996] [2023-02-15 22:45:25,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:25,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278497996] [2023-02-15 22:45:25,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278497996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:25,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:25,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102597183] [2023-02-15 22:45:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:25,924 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,030 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2023-02-15 22:45:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 22:45:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,033 INFO L225 Difference]: With dead ends: 275 [2023-02-15 22:45:26,033 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 22:45:26,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:26,039 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 128 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 367 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 22:45:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2023-02-15 22:45:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 127 states have internal predecessors, (170), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2023-02-15 22:45:26,057 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 14 [2023-02-15 22:45:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,057 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2023-02-15 22:45:26,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2023-02-15 22:45:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:45:26,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:45:26,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2141737346, now seen corresponding path program 1 times [2023-02-15 22:45:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975507924] [2023-02-15 22:45:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975507924] [2023-02-15 22:45:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975507924] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:26,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880074364] [2023-02-15 22:45:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:26,112 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,183 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2023-02-15 22:45:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:26,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:45:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,185 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:45:26,185 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 22:45:26,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:26,191 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 22:45:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2023-02-15 22:45:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5) internal successors, (168), 127 states have internal predecessors, (168), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2023-02-15 22:45:26,211 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 15 [2023-02-15 22:45:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2023-02-15 22:45:26,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2023-02-15 22:45:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:45:26,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:45:26,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -966415747, now seen corresponding path program 1 times [2023-02-15 22:45:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30883085] [2023-02-15 22:45:26,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:45:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30883085] [2023-02-15 22:45:26,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30883085] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:26,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793805747] [2023-02-15 22:45:26,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:26,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:26,255 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,275 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2023-02-15 22:45:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:26,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 22:45:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,277 INFO L225 Difference]: With dead ends: 142 [2023-02-15 22:45:26,277 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 22:45:26,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:26,281 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 22:45:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-15 22:45:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.490909090909091) internal successors, (164), 124 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2023-02-15 22:45:26,296 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 16 [2023-02-15 22:45:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,296 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2023-02-15 22:45:26,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2023-02-15 22:45:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:45:26,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,301 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:45:26,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash 108044843, now seen corresponding path program 1 times [2023-02-15 22:45:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457998006] [2023-02-15 22:45:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:26,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457998006] [2023-02-15 22:45:26,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457998006] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:26,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636652281] [2023-02-15 22:45:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:26,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:26,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:26,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:45:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:45:26,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:26,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:26,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636652281] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 22:45:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019509939] [2023-02-15 22:45:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:26,453 INFO L87 Difference]: Start difference. First operand 131 states and 172 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,484 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2023-02-15 22:45:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:45:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,485 INFO L225 Difference]: With dead ends: 160 [2023-02-15 22:45:26,486 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 22:45:26,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:26,486 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 16 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 22:45:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2023-02-15 22:45:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 126 states have internal predecessors, (167), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-15 22:45:26,492 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 17 [2023-02-15 22:45:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,492 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-15 22:45:26,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2023-02-15 22:45:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:45:26,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:26,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:26,697 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash -406903932, now seen corresponding path program 1 times [2023-02-15 22:45:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304769448] [2023-02-15 22:45:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:45:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304769448] [2023-02-15 22:45:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304769448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:26,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083114649] [2023-02-15 22:45:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:26,730 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,761 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2023-02-15 22:45:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 22:45:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,763 INFO L225 Difference]: With dead ends: 166 [2023-02-15 22:45:26,763 INFO L226 Difference]: Without dead ends: 164 [2023-02-15 22:45:26,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:26,764 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-15 22:45:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 135. [2023-02-15 22:45:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 128 states have internal predecessors, (169), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2023-02-15 22:45:26,769 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 19 [2023-02-15 22:45:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,769 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2023-02-15 22:45:26,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2023-02-15 22:45:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:45:26,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,770 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:45:26,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash 906124417, now seen corresponding path program 1 times [2023-02-15 22:45:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222018514] [2023-02-15 22:45:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222018514] [2023-02-15 22:45:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222018514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:26,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107652056] [2023-02-15 22:45:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:26,810 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,887 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2023-02-15 22:45:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:26,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 22:45:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,888 INFO L225 Difference]: With dead ends: 198 [2023-02-15 22:45:26,888 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 22:45:26,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:26,889 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 295 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 22:45:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 166. [2023-02-15 22:45:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 158 states have internal predecessors, (214), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2023-02-15 22:45:26,894 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 24 [2023-02-15 22:45:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,895 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2023-02-15 22:45:26,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2023-02-15 22:45:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:45:26,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,896 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:45:26,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,896 INFO L85 PathProgramCache]: Analyzing trace with hash 877497061, now seen corresponding path program 1 times [2023-02-15 22:45:26,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638926711] [2023-02-15 22:45:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638926711] [2023-02-15 22:45:26,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638926711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:26,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:26,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043359483] [2023-02-15 22:45:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:26,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:26,929 INFO L87 Difference]: Start difference. First operand 166 states and 222 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:26,983 INFO L93 Difference]: Finished difference Result 190 states and 251 transitions. [2023-02-15 22:45:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 22:45:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:26,984 INFO L225 Difference]: With dead ends: 190 [2023-02-15 22:45:26,984 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 22:45:26,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:26,985 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:26,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 22:45:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 159. [2023-02-15 22:45:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.463768115942029) internal successors, (202), 151 states have internal predecessors, (202), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2023-02-15 22:45:26,991 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 24 [2023-02-15 22:45:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:26,991 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2023-02-15 22:45:26,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2023-02-15 22:45:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:45:26,992 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:26,992 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:26,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:45:26,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:26,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash -339740318, now seen corresponding path program 1 times [2023-02-15 22:45:26,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:26,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64749566] [2023-02-15 22:45:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:45:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:27,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64749566] [2023-02-15 22:45:27,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64749566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:27,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:27,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099608682] [2023-02-15 22:45:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:27,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:27,032 INFO L87 Difference]: Start difference. First operand 159 states and 210 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:27,084 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2023-02-15 22:45:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-15 22:45:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:27,086 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:45:27,086 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 22:45:27,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:27,086 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:27,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 288 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 22:45:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 153. [2023-02-15 22:45:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 145 states have internal predecessors, (193), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2023-02-15 22:45:27,092 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 31 [2023-02-15 22:45:27,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:27,093 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2023-02-15 22:45:27,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2023-02-15 22:45:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:45:27,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:27,094 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:27,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:45:27,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash -368367674, now seen corresponding path program 1 times [2023-02-15 22:45:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:27,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844689839] [2023-02-15 22:45:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:45:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844689839] [2023-02-15 22:45:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844689839] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:27,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:27,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251691597] [2023-02-15 22:45:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:27,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:27,131 INFO L87 Difference]: Start difference. First operand 153 states and 201 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:27,179 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2023-02-15 22:45:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-15 22:45:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:27,180 INFO L225 Difference]: With dead ends: 175 [2023-02-15 22:45:27,180 INFO L226 Difference]: Without dead ends: 173 [2023-02-15 22:45:27,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:27,181 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:27,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 286 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-15 22:45:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2023-02-15 22:45:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 136 states have internal predecessors, (181), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2023-02-15 22:45:27,187 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 31 [2023-02-15 22:45:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:27,187 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2023-02-15 22:45:27,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2023-02-15 22:45:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:45:27,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:27,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:27,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:45:27,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1493195762, now seen corresponding path program 1 times [2023-02-15 22:45:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:27,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859271860] [2023-02-15 22:45:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 22:45:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859271860] [2023-02-15 22:45:27,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859271860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:27,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321892833] [2023-02-15 22:45:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:27,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:45:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:45:27,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:27,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:27,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321892833] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:27,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:27,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2023-02-15 22:45:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549252322] [2023-02-15 22:45:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:27,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:45:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:27,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:45:27,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:27,414 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:27,460 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2023-02-15 22:45:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-02-15 22:45:27,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:27,462 INFO L225 Difference]: With dead ends: 232 [2023-02-15 22:45:27,462 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 22:45:27,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:45:27,462 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 37 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:27,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 459 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 22:45:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2023-02-15 22:45:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 136 states have internal predecessors, (179), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2023-02-15 22:45:27,468 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 35 [2023-02-15 22:45:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:27,478 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2023-02-15 22:45:27,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2023-02-15 22:45:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:27,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:27,480 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:27,486 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 22:45:27,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 22:45:27,687 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1303876285, now seen corresponding path program 1 times [2023-02-15 22:45:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:27,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994966449] [2023-02-15 22:45:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 22:45:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994966449] [2023-02-15 22:45:27,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994966449] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154533894] [2023-02-15 22:45:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:27,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:27,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:45:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:27,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:27,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:27,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 22:45:27,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154533894] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:27,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:27,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2023-02-15 22:45:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565252310] [2023-02-15 22:45:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:27,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:27,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:27,857 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:27,870 INFO L93 Difference]: Finished difference Result 186 states and 235 transitions. [2023-02-15 22:45:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:27,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2023-02-15 22:45:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:27,871 INFO L225 Difference]: With dead ends: 186 [2023-02-15 22:45:27,872 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 22:45:27,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:27,872 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:27,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 22:45:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-02-15 22:45:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 136 states have internal predecessors, (178), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2023-02-15 22:45:27,877 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 39 [2023-02-15 22:45:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:27,878 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2023-02-15 22:45:27,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2023-02-15 22:45:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:45:27,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:27,878 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:27,906 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 22:45:28,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:28,083 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1765516932, now seen corresponding path program 1 times [2023-02-15 22:45:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:28,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938029214] [2023-02-15 22:45:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:28,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 22:45:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938029214] [2023-02-15 22:45:28,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938029214] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427989820] [2023-02-15 22:45:28,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:28,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:28,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:28,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:28,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:45:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:45:28,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:28,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:28,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427989820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:28,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:28,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-15 22:45:28,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948402565] [2023-02-15 22:45:28,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:28,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:45:28,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:28,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:45:28,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:28,241 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:28,280 INFO L93 Difference]: Finished difference Result 242 states and 301 transitions. [2023-02-15 22:45:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:45:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-02-15 22:45:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:28,281 INFO L225 Difference]: With dead ends: 242 [2023-02-15 22:45:28,281 INFO L226 Difference]: Without dead ends: 198 [2023-02-15 22:45:28,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:28,282 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:28,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 561 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-15 22:45:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2023-02-15 22:45:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 141 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:45:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2023-02-15 22:45:28,288 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 40 [2023-02-15 22:45:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:28,288 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2023-02-15 22:45:28,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2023-02-15 22:45:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:45:28,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:28,289 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:28,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:28,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:28,494 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1708258630, now seen corresponding path program 1 times [2023-02-15 22:45:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950918630] [2023-02-15 22:45:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 22:45:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950918630] [2023-02-15 22:45:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950918630] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860593281] [2023-02-15 22:45:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:28,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:28,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:45:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:28,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:45:28,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:28,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:28,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860593281] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:28,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2023-02-15 22:45:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541165803] [2023-02-15 22:45:28,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:28,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:45:28,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:28,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:45:28,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:28,803 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 22:45:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,109 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2023-02-15 22:45:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 22:45:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2023-02-15 22:45:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,111 INFO L225 Difference]: With dead ends: 413 [2023-02-15 22:45:29,112 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 22:45:29,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-02-15 22:45:29,113 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 97 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1183 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 22:45:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2023-02-15 22:45:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.36) internal successors, (170), 134 states have internal predecessors, (170), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2023-02-15 22:45:29,123 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 40 [2023-02-15 22:45:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,123 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2023-02-15 22:45:29,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 22:45:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2023-02-15 22:45:29,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:45:29,124 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,124 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:29,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 22:45:29,330 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2065115993, now seen corresponding path program 1 times [2023-02-15 22:45:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127871360] [2023-02-15 22:45:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 22:45:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 22:45:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127871360] [2023-02-15 22:45:29,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127871360] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:29,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194061328] [2023-02-15 22:45:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:29,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:29,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:29,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:45:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:45:29,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:45:29,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:29,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194061328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:29,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-02-15 22:45:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26397332] [2023-02-15 22:45:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:45:29,549 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,623 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2023-02-15 22:45:29,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:29,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2023-02-15 22:45:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,624 INFO L225 Difference]: With dead ends: 311 [2023-02-15 22:45:29,624 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 22:45:29,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:29,626 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 325 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 22:45:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2023-02-15 22:45:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.347457627118644) internal successors, (159), 127 states have internal predecessors, (159), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2023-02-15 22:45:29,634 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 56 [2023-02-15 22:45:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,634 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2023-02-15 22:45:29,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2023-02-15 22:45:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:45:29,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,635 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:29,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 22:45:29,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -699283725, now seen corresponding path program 1 times [2023-02-15 22:45:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280935305] [2023-02-15 22:45:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 22:45:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-15 22:45:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280935305] [2023-02-15 22:45:29,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280935305] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514121762] [2023-02-15 22:45:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:29,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:29,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:29,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:45:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:45:30,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:45:30,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:30,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514121762] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:30,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:30,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-15 22:45:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393658918] [2023-02-15 22:45:30,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:45:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:45:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:30,154 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,323 INFO L93 Difference]: Finished difference Result 572 states and 721 transitions. [2023-02-15 22:45:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:45:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2023-02-15 22:45:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,325 INFO L225 Difference]: With dead ends: 572 [2023-02-15 22:45:30,325 INFO L226 Difference]: Without dead ends: 464 [2023-02-15 22:45:30,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:45:30,326 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 275 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 426 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-02-15 22:45:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 163. [2023-02-15 22:45:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 154 states have internal predecessors, (193), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2023-02-15 22:45:30,337 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 57 [2023-02-15 22:45:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,337 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2023-02-15 22:45:30,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2023-02-15 22:45:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:45:30,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,338 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:30,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:30,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1499167963, now seen corresponding path program 1 times [2023-02-15 22:45:30,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829050439] [2023-02-15 22:45:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-15 22:45:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-15 22:45:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829050439] [2023-02-15 22:45:30,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829050439] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702445311] [2023-02-15 22:45:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:30,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:45:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:30,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 22:45:30,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:30,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702445311] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:30,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:30,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-15 22:45:30,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645812315] [2023-02-15 22:45:30,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:45:30,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:45:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:30,837 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:31,337 INFO L93 Difference]: Finished difference Result 403 states and 506 transitions. [2023-02-15 22:45:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:45:31,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2023-02-15 22:45:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:31,339 INFO L225 Difference]: With dead ends: 403 [2023-02-15 22:45:31,339 INFO L226 Difference]: Without dead ends: 281 [2023-02-15 22:45:31,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:31,339 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:31,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 513 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-15 22:45:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 156. [2023-02-15 22:45:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 147 states have internal predecessors, (179), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:45:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2023-02-15 22:45:31,347 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 61 [2023-02-15 22:45:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:31,348 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2023-02-15 22:45:31,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2023-02-15 22:45:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 22:45:31,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:31,349 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:31,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 22:45:31,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 22:45:31,553 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash 239667187, now seen corresponding path program 2 times [2023-02-15 22:45:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:31,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424950392] [2023-02-15 22:45:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:31,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 22:45:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-15 22:45:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424950392] [2023-02-15 22:45:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424950392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648927030] [2023-02-15 22:45:31,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:31,705 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:31,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:45:31,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:45:31,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:31,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:45:31,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-15 22:45:31,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:31,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648927030] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:31,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:31,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-02-15 22:45:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735456954] [2023-02-15 22:45:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:31,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:45:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:31,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:45:31,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:45:31,796 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:31,858 INFO L93 Difference]: Finished difference Result 294 states and 349 transitions. [2023-02-15 22:45:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:45:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-02-15 22:45:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:31,859 INFO L225 Difference]: With dead ends: 294 [2023-02-15 22:45:31,859 INFO L226 Difference]: Without dead ends: 251 [2023-02-15 22:45:31,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:45:31,860 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 94 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:31,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 742 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-15 22:45:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 177. [2023-02-15 22:45:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2721518987341771) internal successors, (201), 167 states have internal predecessors, (201), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:45:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2023-02-15 22:45:31,867 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 77 [2023-02-15 22:45:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:31,868 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2023-02-15 22:45:31,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2023-02-15 22:45:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-15 22:45:31,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:31,885 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:31,903 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 22:45:32,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 22:45:32,086 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2114891252, now seen corresponding path program 1 times [2023-02-15 22:45:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761452087] [2023-02-15 22:45:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-15 22:45:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-15 22:45:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:32,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:32,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761452087] [2023-02-15 22:45:32,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761452087] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:32,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893993651] [2023-02-15 22:45:32,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:32,257 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 22:45:32,300 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 22:45:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:32,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:32,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:32,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893993651] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:32,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:32,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-15 22:45:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468124424] [2023-02-15 22:45:32,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:32,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:45:32,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:45:32,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:45:32,630 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:33,045 INFO L93 Difference]: Finished difference Result 986 states and 1243 transitions. [2023-02-15 22:45:33,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:45:33,045 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2023-02-15 22:45:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:33,048 INFO L225 Difference]: With dead ends: 986 [2023-02-15 22:45:33,048 INFO L226 Difference]: Without dead ends: 857 [2023-02-15 22:45:33,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=488, Invalid=772, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 22:45:33,049 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 536 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:33,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1047 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-02-15 22:45:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 224. [2023-02-15 22:45:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 214 states have internal predecessors, (259), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:45:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 268 transitions. [2023-02-15 22:45:33,064 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 268 transitions. Word has length 82 [2023-02-15 22:45:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:33,064 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 268 transitions. [2023-02-15 22:45:33,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 268 transitions. [2023-02-15 22:45:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 22:45:33,065 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:33,065 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:33,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-02-15 22:45:33,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:33,270 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:33,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1818476286, now seen corresponding path program 1 times [2023-02-15 22:45:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:33,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671874992] [2023-02-15 22:45:33,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:33,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 22:45:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-15 22:45:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:33,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671874992] [2023-02-15 22:45:33,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671874992] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:33,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844822015] [2023-02-15 22:45:33,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:33,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:33,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:33,483 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 22:45:33,485 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 22:45:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:45:33,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 32 proven. 75 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:33,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844822015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:33,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:33,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 22:45:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618085766] [2023-02-15 22:45:33,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:33,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 22:45:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 22:45:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:45:33,915 INFO L87 Difference]: Start difference. First operand 224 states and 268 transitions. Second operand has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:42,136 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 41 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:45:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:50,017 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2023-02-15 22:45:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:45:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2023-02-15 22:45:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:50,019 INFO L225 Difference]: With dead ends: 589 [2023-02-15 22:45:50,019 INFO L226 Difference]: Without dead ends: 446 [2023-02-15 22:45:50,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=503, Invalid=902, Unknown=1, NotChecked=0, Total=1406 [2023-02-15 22:45:50,021 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 201 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:50,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 996 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:45:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-02-15 22:45:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 217. [2023-02-15 22:45:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 198 states have (on average 1.2171717171717171) internal successors, (241), 207 states have internal predecessors, (241), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:45:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2023-02-15 22:45:50,037 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 86 [2023-02-15 22:45:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:50,037 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2023-02-15 22:45:50,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2023-02-15 22:45:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-02-15 22:45:50,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:50,038 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:50,051 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 22:45:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:50,244 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:50,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1334776844, now seen corresponding path program 2 times [2023-02-15 22:45:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:50,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864552652] [2023-02-15 22:45:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:50,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:50,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-15 22:45:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-02-15 22:45:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:50,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864552652] [2023-02-15 22:45:50,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864552652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:50,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928562800] [2023-02-15 22:45:50,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:50,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:50,650 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:50,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:45:50,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:45:50,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:50,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:45:50,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:50,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:51,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928562800] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:51,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:51,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-15 22:45:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062890331] [2023-02-15 22:45:51,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:51,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 22:45:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 22:45:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 22:45:51,655 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:52,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:52,556 INFO L93 Difference]: Finished difference Result 1730 states and 2195 transitions. [2023-02-15 22:45:52,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-15 22:45:52,557 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2023-02-15 22:45:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:52,561 INFO L225 Difference]: With dead ends: 1730 [2023-02-15 22:45:52,561 INFO L226 Difference]: Without dead ends: 1601 [2023-02-15 22:45:52,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1744, Invalid=2812, Unknown=0, NotChecked=0, Total=4556 [2023-02-15 22:45:52,563 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1351 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:52,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1135 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:45:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2023-02-15 22:45:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 304. [2023-02-15 22:45:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 285 states have (on average 1.2175438596491228) internal successors, (347), 294 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 22:45:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 356 transitions. [2023-02-15 22:45:52,588 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 356 transitions. Word has length 122 [2023-02-15 22:45:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:52,589 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 356 transitions. [2023-02-15 22:45:52,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 356 transitions. [2023-02-15 22:45:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-15 22:45:52,590 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:52,590 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:52,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:52,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 22:45:52,795 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash 783253250, now seen corresponding path program 2 times [2023-02-15 22:45:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987408924] [2023-02-15 22:45:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:52,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-02-15 22:45:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-02-15 22:45:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 4 proven. 471 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:53,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987408924] [2023-02-15 22:45:53,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987408924] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:53,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937981744] [2023-02-15 22:45:53,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:53,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:53,369 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:45:53,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:45:53,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:53,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:45:53,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-15 22:45:53,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-15 22:45:53,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937981744] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:53,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:53,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 28 [2023-02-15 22:45:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736661551] [2023-02-15 22:45:53,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:53,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 22:45:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:53,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 22:45:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:45:53,760 INFO L87 Difference]: Start difference. First operand 304 states and 356 transitions. Second operand has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 22:45:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:54,558 INFO L93 Difference]: Finished difference Result 698 states and 839 transitions. [2023-02-15 22:45:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 22:45:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 126 [2023-02-15 22:45:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:54,561 INFO L225 Difference]: With dead ends: 698 [2023-02-15 22:45:54,561 INFO L226 Difference]: Without dead ends: 566 [2023-02-15 22:45:54,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 22:45:54,563 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 381 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:54,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2421 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:45:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-15 22:45:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 313. [2023-02-15 22:45:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 292 states have (on average 1.2089041095890412) internal successors, (353), 300 states have internal predecessors, (353), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 366 transitions. [2023-02-15 22:45:54,584 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 366 transitions. Word has length 126 [2023-02-15 22:45:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:54,584 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 366 transitions. [2023-02-15 22:45:54,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 22:45:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 366 transitions. [2023-02-15 22:45:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-15 22:45:54,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:54,585 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:54,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:54,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 22:45:54,791 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -303496585, now seen corresponding path program 1 times [2023-02-15 22:45:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:54,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238784631] [2023-02-15 22:45:54,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:54,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-15 22:45:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 22:45:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 4 proven. 547 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 22:45:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:55,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238784631] [2023-02-15 22:45:55,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238784631] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:55,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661778910] [2023-02-15 22:45:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:55,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:55,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:55,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:45:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:45:55,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-15 22:45:55,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-15 22:45:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661778910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:56,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 9] total 36 [2023-02-15 22:45:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454906089] [2023-02-15 22:45:56,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:56,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 22:45:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 22:45:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 22:45:56,173 INFO L87 Difference]: Start difference. First operand 313 states and 366 transitions. Second operand has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 22:45:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:57,709 INFO L93 Difference]: Finished difference Result 876 states and 1049 transitions. [2023-02-15 22:45:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 22:45:57,709 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 136 [2023-02-15 22:45:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:57,711 INFO L225 Difference]: With dead ends: 876 [2023-02-15 22:45:57,711 INFO L226 Difference]: Without dead ends: 735 [2023-02-15 22:45:57,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=437, Invalid=2755, Unknown=0, NotChecked=0, Total=3192 [2023-02-15 22:45:57,713 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 755 mSDsluCounter, 3071 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:57,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 3272 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:45:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2023-02-15 22:45:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 329. [2023-02-15 22:45:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.2124183006535947) internal successors, (371), 314 states have internal predecessors, (371), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-15 22:45:57,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 388 transitions. [2023-02-15 22:45:57,740 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 388 transitions. Word has length 136 [2023-02-15 22:45:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:57,740 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 388 transitions. [2023-02-15 22:45:57,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 22:45:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 388 transitions. [2023-02-15 22:45:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-02-15 22:45:57,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:57,742 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:57,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:57,946 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1862848251, now seen corresponding path program 1 times [2023-02-15 22:45:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:57,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861584679] [2023-02-15 22:45:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:45:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 22:45:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 4 proven. 622 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 22:45:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861584679] [2023-02-15 22:45:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861584679] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224316898] [2023-02-15 22:45:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:58,483 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:45:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:45:58,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2023-02-15 22:45:58,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:58,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224316898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:58,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:58,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 29 [2023-02-15 22:45:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551441065] [2023-02-15 22:45:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:58,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:45:58,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:45:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-02-15 22:45:58,826 INFO L87 Difference]: Start difference. First operand 329 states and 388 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:59,209 INFO L93 Difference]: Finished difference Result 544 states and 643 transitions. [2023-02-15 22:45:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 141 [2023-02-15 22:45:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:59,210 INFO L225 Difference]: With dead ends: 544 [2023-02-15 22:45:59,211 INFO L226 Difference]: Without dead ends: 501 [2023-02-15 22:45:59,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 22:45:59,211 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 209 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:59,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1416 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-02-15 22:45:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 362. [2023-02-15 22:45:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 338 states have (on average 1.2218934911242603) internal successors, (413), 344 states have internal predecessors, (413), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 22:45:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 433 transitions. [2023-02-15 22:45:59,271 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 433 transitions. Word has length 141 [2023-02-15 22:45:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:59,271 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 433 transitions. [2023-02-15 22:45:59,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 433 transitions. [2023-02-15 22:45:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 22:45:59,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:59,273 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:59,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:59,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:59,478 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:45:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash -8442539, now seen corresponding path program 1 times [2023-02-15 22:45:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:59,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115782028] [2023-02-15 22:45:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:45:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 22:45:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:59,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115782028] [2023-02-15 22:45:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115782028] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452544295] [2023-02-15 22:45:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:59,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:59,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:59,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:59,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:46:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:46:00,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-15 22:46:00,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:00,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452544295] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:00,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:46:00,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2023-02-15 22:46:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100092916] [2023-02-15 22:46:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:00,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:46:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:46:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:46:00,447 INFO L87 Difference]: Start difference. First operand 362 states and 433 transitions. Second operand has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:46:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:00,624 INFO L93 Difference]: Finished difference Result 460 states and 543 transitions. [2023-02-15 22:46:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:46:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2023-02-15 22:46:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:00,631 INFO L225 Difference]: With dead ends: 460 [2023-02-15 22:46:00,631 INFO L226 Difference]: Without dead ends: 456 [2023-02-15 22:46:00,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:46:00,637 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 183 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:00,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 639 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:46:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-15 22:46:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 395. [2023-02-15 22:46:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 371 states have (on average 1.2237196765498652) internal successors, (454), 377 states have internal predecessors, (454), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 22:46:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 474 transitions. [2023-02-15 22:46:00,673 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 474 transitions. Word has length 142 [2023-02-15 22:46:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:00,673 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 474 transitions. [2023-02-15 22:46:00,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:46:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 474 transitions. [2023-02-15 22:46:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-02-15 22:46:00,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:00,676 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:46:00,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 22:46:00,883 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:46:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1414285669, now seen corresponding path program 1 times [2023-02-15 22:46:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:00,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819959603] [2023-02-15 22:46:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:46:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:46:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:46:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 22:46:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-02-15 22:46:00,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:46:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819959603] [2023-02-15 22:46:00,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819959603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:00,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:46:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001070223] [2023-02-15 22:46:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:46:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:46:01,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:46:01,000 INFO L87 Difference]: Start difference. First operand 395 states and 474 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:46:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:01,077 INFO L93 Difference]: Finished difference Result 657 states and 806 transitions. [2023-02-15 22:46:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:46:01,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 142 [2023-02-15 22:46:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:01,079 INFO L225 Difference]: With dead ends: 657 [2023-02-15 22:46:01,079 INFO L226 Difference]: Without dead ends: 439 [2023-02-15 22:46:01,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:46:01,080 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:01,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-15 22:46:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 415. [2023-02-15 22:46:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 391 states have (on average 1.2122762148337596) internal successors, (474), 397 states have internal predecessors, (474), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 22:46:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 494 transitions. [2023-02-15 22:46:01,112 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 494 transitions. Word has length 142 [2023-02-15 22:46:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:01,112 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 494 transitions. [2023-02-15 22:46:01,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:46:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 494 transitions. [2023-02-15 22:46:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 22:46:01,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:01,114 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:01,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 22:46:01,115 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:46:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -261718500, now seen corresponding path program 1 times [2023-02-15 22:46:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:01,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839268379] [2023-02-15 22:46:01,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:01,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:46:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:46:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:46:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-15 22:46:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:46:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:46:01,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839268379] [2023-02-15 22:46:01,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839268379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:46:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012363918] [2023-02-15 22:46:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:01,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:46:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:46:01,625 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:46:01,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 22:46:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:01,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:46:01,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-15 22:46:02,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:02,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012363918] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:02,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:46:02,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [20] total 28 [2023-02-15 22:46:02,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681608391] [2023-02-15 22:46:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:02,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:46:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:46:02,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:46:02,071 INFO L87 Difference]: Start difference. First operand 415 states and 494 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:46:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:02,241 INFO L93 Difference]: Finished difference Result 483 states and 567 transitions. [2023-02-15 22:46:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:46:02,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 143 [2023-02-15 22:46:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:02,243 INFO L225 Difference]: With dead ends: 483 [2023-02-15 22:46:02,243 INFO L226 Difference]: Without dead ends: 474 [2023-02-15 22:46:02,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:46:02,243 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 166 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:02,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 674 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:46:02,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-02-15 22:46:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 415. [2023-02-15 22:46:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 391 states have (on average 1.2046035805626598) internal successors, (471), 397 states have internal predecessors, (471), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-15 22:46:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 491 transitions. [2023-02-15 22:46:02,299 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 491 transitions. Word has length 143 [2023-02-15 22:46:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:02,300 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 491 transitions. [2023-02-15 22:46:02,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:46:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 491 transitions. [2023-02-15 22:46:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 22:46:02,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:02,301 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:02,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:46:02,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 22:46:02,506 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:46:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:02,507 INFO L85 PathProgramCache]: Analyzing trace with hash -280681651, now seen corresponding path program 1 times [2023-02-15 22:46:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:02,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232913097] [2023-02-15 22:46:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:46:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:46:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:46:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 22:46:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-15 22:46:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:46:02,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232913097] [2023-02-15 22:46:02,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232913097] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:46:02,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340791185] [2023-02-15 22:46:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:46:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:46:02,786 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:46:02,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 22:46:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:02,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:46:02,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 22:46:03,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-15 22:46:03,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340791185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:03,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:46:03,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2023-02-15 22:46:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488344605] [2023-02-15 22:46:03,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:03,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 22:46:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 22:46:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:46:03,136 INFO L87 Difference]: Start difference. First operand 415 states and 491 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:46:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:03,964 INFO L93 Difference]: Finished difference Result 1205 states and 1401 transitions. [2023-02-15 22:46:03,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 22:46:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 143 [2023-02-15 22:46:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:03,967 INFO L225 Difference]: With dead ends: 1205 [2023-02-15 22:46:03,968 INFO L226 Difference]: Without dead ends: 1155 [2023-02-15 22:46:03,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=2011, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 22:46:03,969 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 1391 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:03,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 3610 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:46:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2023-02-15 22:46:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 449. [2023-02-15 22:46:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 423 states have (on average 1.2056737588652482) internal successors, (510), 427 states have internal predecessors, (510), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 17 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 22:46:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2023-02-15 22:46:04,002 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 143 [2023-02-15 22:46:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:04,002 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2023-02-15 22:46:04,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 21 states have internal predecessors, (89), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:46:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2023-02-15 22:46:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-02-15 22:46:04,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:04,004 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:04,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:46:04,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 22:46:04,209 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:46:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -280679729, now seen corresponding path program 1 times [2023-02-15 22:46:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:04,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618933675] [2023-02-15 22:46:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:46:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:46:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-15 22:46:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-15 22:46:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 4 proven. 616 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:46:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:46:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618933675] [2023-02-15 22:46:04,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618933675] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:46:04,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745438950] [2023-02-15 22:46:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:04,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:46:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:46:04,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:46:04,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 22:46:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:04,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:46:04,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 22:46:05,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-15 22:46:05,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745438950] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:05,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:46:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 10] total 39 [2023-02-15 22:46:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979546179] [2023-02-15 22:46:05,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 22:46:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 22:46:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 22:46:05,597 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 22:46:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:07,791 INFO L93 Difference]: Finished difference Result 1243 states and 1490 transitions. [2023-02-15 22:46:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 22:46:07,792 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 143 [2023-02-15 22:46:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:07,794 INFO L225 Difference]: With dead ends: 1243 [2023-02-15 22:46:07,794 INFO L226 Difference]: Without dead ends: 966 [2023-02-15 22:46:07,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=549, Invalid=3873, Unknown=0, NotChecked=0, Total=4422 [2023-02-15 22:46:07,796 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 1108 mSDsluCounter, 3577 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:07,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 3840 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:46:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2023-02-15 22:46:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 456. [2023-02-15 22:46:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 430 states have (on average 1.2069767441860466) internal successors, (519), 433 states have internal predecessors, (519), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 22:46:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 544 transitions. [2023-02-15 22:46:07,830 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 544 transitions. Word has length 143 [2023-02-15 22:46:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:07,830 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 544 transitions. [2023-02-15 22:46:07,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.0) internal successors, (195), 37 states have internal predecessors, (195), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-15 22:46:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 544 transitions. [2023-02-15 22:46:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-02-15 22:46:07,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:07,832 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:07,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:46:08,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:46:08,037 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:46:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 158634451, now seen corresponding path program 1 times [2023-02-15 22:46:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:08,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896769792] [2023-02-15 22:46:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:46:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:46:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-02-15 22:46:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-02-15 22:46:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 22:46:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:46:08,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896769792] [2023-02-15 22:46:08,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896769792] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:46:08,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773517978] [2023-02-15 22:46:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:46:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:46:08,537 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:46:08,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 22:46:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:08,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 22:46:08,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 38 proven. 680 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 22:46:09,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-15 22:46:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773517978] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:09,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:46:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2023-02-15 22:46:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983894908] [2023-02-15 22:46:09,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 22:46:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:46:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 22:46:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=2545, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 22:46:09,827 INFO L87 Difference]: Start difference. First operand 456 states and 544 transitions. Second operand has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:46:26,721 WARN L233 SmtUtils]: Spent 14.26s on a formula simplification. DAG size of input: 62 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:46:42,708 WARN L233 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 58 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:46:56,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 22:46:58,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 22:47:00,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 22:47:02,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 22:47:04,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-15 22:47:29,149 WARN L233 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 76 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:48:02,351 WARN L233 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 58 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:49:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:28,745 INFO L93 Difference]: Finished difference Result 1387 states and 1729 transitions. [2023-02-15 22:49:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-15 22:49:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2023-02-15 22:49:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:28,767 INFO L225 Difference]: With dead ends: 1387 [2023-02-15 22:49:28,767 INFO L226 Difference]: Without dead ends: 1081 [2023-02-15 22:49:28,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2254 ImplicationChecksByTransitivity, 186.9s TimeCoverageRelationStatistics Valid=2654, Invalid=6433, Unknown=33, NotChecked=0, Total=9120 [2023-02-15 22:49:28,771 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 681 mSDsluCounter, 3028 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 82 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 3861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:28,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 3181 Invalid, 3861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3775 Invalid, 4 Unknown, 0 Unchecked, 12.8s Time] [2023-02-15 22:49:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-02-15 22:49:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 484. [2023-02-15 22:49:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 458 states have (on average 1.1790393013100438) internal successors, (540), 461 states have internal predecessors, (540), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-15 22:49:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 565 transitions. [2023-02-15 22:49:28,828 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 565 transitions. Word has length 148 [2023-02-15 22:49:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:28,828 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 565 transitions. [2023-02-15 22:49:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 5.637931034482759) internal successors, (327), 58 states have internal predecessors, (327), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:49:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 565 transitions. [2023-02-15 22:49:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-15 22:49:28,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:28,830 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:28,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-15 22:49:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:49:29,035 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1909714657, now seen corresponding path program 2 times [2023-02-15 22:49:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:49:29,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804416557] [2023-02-15 22:49:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:29,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:49:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:49:29,066 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:49:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:49:29,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:49:29,111 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:49:29,112 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-15 22:49:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-15 22:49:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-15 22:49:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-15 22:49:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-15 22:49:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-15 22:49:29,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 22:49:29,117 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:29,119 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:49:29,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:49:29 BoogieIcfgContainer [2023-02-15 22:49:29,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:49:29,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:49:29,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:49:29,160 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:49:29,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:25" (3/4) ... [2023-02-15 22:49:29,163 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:49:29,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:49:29,163 INFO L158 Benchmark]: Toolchain (without parser) took 244584.23ms. Allocated memory was 205.5MB in the beginning and 400.6MB in the end (delta: 195.0MB). Free memory was 155.9MB in the beginning and 171.9MB in the end (delta: -16.0MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,163 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:49:29,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.70ms. Allocated memory is still 205.5MB. Free memory was 155.9MB in the beginning and 142.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.33ms. Allocated memory is still 205.5MB. Free memory was 142.6MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,164 INFO L158 Benchmark]: Boogie Preprocessor took 20.89ms. Allocated memory is still 205.5MB. Free memory was 139.9MB in the beginning and 138.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,164 INFO L158 Benchmark]: RCFGBuilder took 478.91ms. Allocated memory is still 205.5MB. Free memory was 138.4MB in the beginning and 116.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,164 INFO L158 Benchmark]: TraceAbstraction took 243772.45ms. Allocated memory was 205.5MB in the beginning and 400.6MB in the end (delta: 195.0MB). Free memory was 116.0MB in the beginning and 171.9MB in the end (delta: -55.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2023-02-15 22:49:29,164 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 400.6MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:49:29,165 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.14ms. Allocated memory is still 134.2MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.70ms. Allocated memory is still 205.5MB. Free memory was 155.9MB in the beginning and 142.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.33ms. Allocated memory is still 205.5MB. Free memory was 142.6MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.89ms. Allocated memory is still 205.5MB. Free memory was 139.9MB in the beginning and 138.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.91ms. Allocated memory is still 205.5MB. Free memory was 138.4MB in the beginning and 116.1MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 243772.45ms. Allocated memory was 205.5MB in the beginning and 400.6MB in the end (delta: 195.0MB). Free memory was 116.0MB in the beginning and 171.9MB in the end (delta: -55.9MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 400.6MB. Free memory is still 171.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 171. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-127, eb=-128] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-127, eb=-128, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, one=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=-36028797002186751, __retres4=16777217, e=-128, m=16777217, res=16777217] [L241] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=-36028797002186751, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L242] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L165] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 243.7s, OverallIterations: 31, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 224.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 8667 SdHoareTripleChecker+Valid, 18.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8633 mSDsluCounter, 30016 SdHoareTripleChecker+Invalid, 17.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26525 mSDsCounter, 555 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14583 IncrementalHoareTripleChecker+Invalid, 15142 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 555 mSolverCounterUnsat, 3491 mSDtfsCounter, 14583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3791 GetRequests, 3109 SyntacticMatches, 8 SemanticMatches, 674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5930 ImplicationChecksByTransitivity, 209.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=484occurred in iteration=30, InterpolantAutomatonStates: 489, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 5883 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 4176 NumberOfCodeBlocks, 4118 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 5187 ConstructedInterpolants, 0 QuantifiedInterpolants, 20831 SizeOfPredicates, 78 NumberOfNonLiveVariables, 4379 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 64 InterpolantComputations, 18 PerfectInterpolantSequences, 9156/17048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 22:49:29,374 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-02-15 22:49:29,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:49:30,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:49:30,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:49:30,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:49:30,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:49:30,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:49:30,964 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:49:30,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:49:30,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:49:30,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:49:30,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:49:30,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:49:30,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:49:30,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:49:30,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:49:30,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:49:30,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:49:30,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:49:30,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:49:30,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:49:30,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:49:30,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:49:30,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:49:30,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:49:30,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:49:30,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:49:30,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:49:30,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:49:30,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:49:30,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:49:30,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:49:31,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:49:31,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:49:31,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:49:31,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:49:31,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:49:31,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:49:31,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:49:31,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:49:31,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:49:31,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:49:31,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 22:49:31,032 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:49:31,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:49:31,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:49:31,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:49:31,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:49:31,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:49:31,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:49:31,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:49:31,035 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:49:31,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:49:31,035 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:49:31,036 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:49:31,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:49:31,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:49:31,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:49:31,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:49:31,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:49:31,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:49:31,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:49:31,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:49:31,039 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:49:31,040 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-15 22:49:31,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:49:31,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:49:31,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:49:31,282 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:49:31,282 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:49:31,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 22:49:32,284 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:49:32,520 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:49:32,522 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-15 22:49:32,529 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c94d1572/1c0ebaa626334c1aae3fa06799da9d47/FLAGef430f52c [2023-02-15 22:49:32,539 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c94d1572/1c0ebaa626334c1aae3fa06799da9d47 [2023-02-15 22:49:32,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:49:32,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:49:32,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:49:32,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:49:32,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:49:32,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4707a44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32, skipping insertion in model container [2023-02-15 22:49:32,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:49:32,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:49:32,660 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c[728,741] [2023-02-15 22:49:32,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:49:32,733 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:49:32,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_3a.c.cil.c[728,741] [2023-02-15 22:49:32,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:49:32,782 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:49:32,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32 WrapperNode [2023-02-15 22:49:32,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:49:32,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:49:32,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:49:32,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:49:32,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,821 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2023-02-15 22:49:32,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:49:32,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:49:32,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:49:32,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:49:32,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,838 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:49:32,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:49:32,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:49:32,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:49:32,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (1/1) ... [2023-02-15 22:49:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:49:32,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:49:32,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:49:32,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:49:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:49:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:49:32,932 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:49:32,933 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:49:32,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:49:32,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:49:32,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:49:32,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:49:33,010 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:49:33,015 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:49:33,306 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:49:33,311 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:49:33,311 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:49:33,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:33 BoogieIcfgContainer [2023-02-15 22:49:33,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:49:33,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:49:33,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:49:33,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:49:33,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:49:32" (1/3) ... [2023-02-15 22:49:33,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe45114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:33, skipping insertion in model container [2023-02-15 22:49:33,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:49:32" (2/3) ... [2023-02-15 22:49:33,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe45114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:49:33, skipping insertion in model container [2023-02-15 22:49:33,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:49:33" (3/3) ... [2023-02-15 22:49:33,318 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-15 22:49:33,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:49:33,328 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-15 22:49:33,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:49:33,361 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;@3767ebd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:49:33,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-15 22:49:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:49:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:49:33,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:33,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:33,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:33,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1033814779, now seen corresponding path program 1 times [2023-02-15 22:49:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101646149] [2023-02-15 22:49:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:33,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:33,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:33,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:49:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:33,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 22:49:33,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:33,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:49:33,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101646149] [2023-02-15 22:49:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101646149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:49:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:49:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:49:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854273697] [2023-02-15 22:49:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:49:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:49:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:49:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:49:33,497 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:49:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:33,517 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2023-02-15 22:49:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:49:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:49:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:33,524 INFO L225 Difference]: With dead ends: 159 [2023-02-15 22:49:33,524 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 22:49:33,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:49:33,531 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:33,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:49:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 22:49:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-15 22:49:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 51 states have internal predecessors, (59), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-02-15 22:49:33,563 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 9 [2023-02-15 22:49:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:33,563 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-02-15 22:49:33,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:49:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-02-15 22:49:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:49:33,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:33,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:33,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:49:33,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:33,767 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1034756045, now seen corresponding path program 1 times [2023-02-15 22:49:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:33,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637802037] [2023-02-15 22:49:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:33,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:33,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:33,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:33,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:49:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:33,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:49:33,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:33,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:49:33,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637802037] [2023-02-15 22:49:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637802037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:49:33,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:49:33,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:49:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911249850] [2023-02-15 22:49:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:49:33,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:49:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:49:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:49:33,862 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:49:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:33,918 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2023-02-15 22:49:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:49:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:49:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:33,921 INFO L225 Difference]: With dead ends: 119 [2023-02-15 22:49:33,921 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 22:49:33,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:49:33,922 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:33,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 178 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:49:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 22:49:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-02-15 22:49:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 55 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2023-02-15 22:49:33,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 9 [2023-02-15 22:49:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:33,930 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2023-02-15 22:49:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:49:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2023-02-15 22:49:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:49:33,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:33,931 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:33,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:34,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,138 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1755996823, now seen corresponding path program 1 times [2023-02-15 22:49:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:34,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966117671] [2023-02-15 22:49:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:34,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:34,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:49:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:34,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:49:34,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:34,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:49:34,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966117671] [2023-02-15 22:49:34,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966117671] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:49:34,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:49:34,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:49:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160373277] [2023-02-15 22:49:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:49:34,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:49:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:34,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:49:34,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:49:34,230 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:34,307 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2023-02-15 22:49:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:49:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:49:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:34,310 INFO L225 Difference]: With dead ends: 151 [2023-02-15 22:49:34,310 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 22:49:34,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:49:34,312 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:34,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 169 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:49:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 22:49:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-15 22:49:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 84 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2023-02-15 22:49:34,327 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 16 [2023-02-15 22:49:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:34,328 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2023-02-15 22:49:34,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2023-02-15 22:49:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:49:34,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:34,331 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:34,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:34,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1427259253, now seen corresponding path program 1 times [2023-02-15 22:49:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814452687] [2023-02-15 22:49:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:34,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:34,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:49:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:34,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:49:34,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:34,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:49:34,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814452687] [2023-02-15 22:49:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814452687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:49:34,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:49:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:49:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455848413] [2023-02-15 22:49:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:49:34,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:49:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:49:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:49:34,598 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:34,644 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2023-02-15 22:49:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:49:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 22:49:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:34,646 INFO L225 Difference]: With dead ends: 162 [2023-02-15 22:49:34,646 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 22:49:34,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:49:34,647 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:34,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 238 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:49:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 22:49:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2023-02-15 22:49:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 73 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-02-15 22:49:34,654 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2023-02-15 22:49:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:34,654 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-02-15 22:49:34,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-02-15 22:49:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:49:34,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:34,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:34,667 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 22:49:34,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1427150149, now seen corresponding path program 1 times [2023-02-15 22:49:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:34,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984855708] [2023-02-15 22:49:34,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:34,870 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:34,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:49:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:34,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:49:34,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:34,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:35,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:35,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984855708] [2023-02-15 22:49:35,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984855708] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:35,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:35,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 22:49:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896322139] [2023-02-15 22:49:35,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:35,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:49:35,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:49:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:49:35,009 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:35,312 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2023-02-15 22:49:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:49:35,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 22:49:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:35,313 INFO L225 Difference]: With dead ends: 173 [2023-02-15 22:49:35,313 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 22:49:35,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:49:35,314 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 271 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:49:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 22:49:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-15 22:49:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.25) internal successors, (85), 74 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-15 22:49:35,323 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 21 [2023-02-15 22:49:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:35,323 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-15 22:49:35,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2023-02-15 22:49:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:49:35,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:35,324 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:35,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-15 22:49:35,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:35,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 268685593, now seen corresponding path program 1 times [2023-02-15 22:49:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:35,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017852767] [2023-02-15 22:49:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:35,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:35,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:35,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:49:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:35,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:49:35,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:35,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:35,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:35,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017852767] [2023-02-15 22:49:35,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017852767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:35,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:35,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:49:35,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830269713] [2023-02-15 22:49:35,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:35,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:49:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:49:35,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:49:35,687 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:35,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:35,884 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2023-02-15 22:49:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:49:35,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-15 22:49:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:35,886 INFO L225 Difference]: With dead ends: 176 [2023-02-15 22:49:35,886 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 22:49:35,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:49:35,891 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:35,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 474 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:49:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 22:49:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2023-02-15 22:49:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 92 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-15 22:49:35,912 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 26 [2023-02-15 22:49:35,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:35,912 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-15 22:49:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-15 22:49:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:49:35,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:35,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:35,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:36,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:36,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1743264717, now seen corresponding path program 1 times [2023-02-15 22:49:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:36,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119736391] [2023-02-15 22:49:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:36,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:36,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:49:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:36,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:49:36,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:36,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:36,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:36,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119736391] [2023-02-15 22:49:36,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119736391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:36,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:36,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:49:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574323150] [2023-02-15 22:49:36,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:36,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:49:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:36,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:49:36,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:49:36,410 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:36,773 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2023-02-15 22:49:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:49:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-15 22:49:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:36,774 INFO L225 Difference]: With dead ends: 243 [2023-02-15 22:49:36,775 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 22:49:36,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:49:36,775 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:36,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 348 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:49:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 22:49:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 102. [2023-02-15 22:49:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 94 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-02-15 22:49:36,791 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 38 [2023-02-15 22:49:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:36,792 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-02-15 22:49:36,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-02-15 22:49:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:49:36,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:36,796 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:36,802 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 (8)] Ended with exit code 0 [2023-02-15 22:49:37,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:37,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 171656217, now seen corresponding path program 2 times [2023-02-15 22:49:37,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:37,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546880854] [2023-02-15 22:49:37,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:49:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:37,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:37,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:49:37,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:49:37,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:49:37,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:49:37,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:37,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:49:37,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:37,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546880854] [2023-02-15 22:49:37,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546880854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:37,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:37,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-15 22:49:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967392937] [2023-02-15 22:49:37,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:37,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:49:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:49:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:49:37,475 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:39,284 INFO L93 Difference]: Finished difference Result 244 states and 288 transitions. [2023-02-15 22:49:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:49:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 22:49:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:39,286 INFO L225 Difference]: With dead ends: 244 [2023-02-15 22:49:39,286 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 22:49:39,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=1102, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 22:49:39,287 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 421 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:39,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 700 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:49:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 22:49:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 134. [2023-02-15 22:49:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 126 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2023-02-15 22:49:39,298 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 46 [2023-02-15 22:49:39,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:39,299 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2023-02-15 22:49:39,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:49:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2023-02-15 22:49:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:49:39,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:39,300 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:39,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:39,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:39,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1785526182, now seen corresponding path program 1 times [2023-02-15 22:49:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:39,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249584018] [2023-02-15 22:49:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:39,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:39,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:39,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:39,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:49:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:39,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:49:39,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 12 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:39,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 12 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:39,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249584018] [2023-02-15 22:49:39,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249584018] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:39,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:39,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 22:49:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254629972] [2023-02-15 22:49:39,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:39,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:49:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:49:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:49:39,953 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:40,593 INFO L93 Difference]: Finished difference Result 389 states and 477 transitions. [2023-02-15 22:49:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:49:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2023-02-15 22:49:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:40,595 INFO L225 Difference]: With dead ends: 389 [2023-02-15 22:49:40,596 INFO L226 Difference]: Without dead ends: 299 [2023-02-15 22:49:40,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:49:40,597 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 189 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:40,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 824 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:49:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-15 22:49:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 167. [2023-02-15 22:49:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 159 states have internal predecessors, (185), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2023-02-15 22:49:40,615 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 59 [2023-02-15 22:49:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:40,615 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2023-02-15 22:49:40,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2023-02-15 22:49:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 22:49:40,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:40,616 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:40,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:40,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:40,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:40,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1092781201, now seen corresponding path program 1 times [2023-02-15 22:49:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:40,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46167231] [2023-02-15 22:49:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:49:40,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:40,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:40,824 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:49:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:49:40,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:49:40,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:41,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 9 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:41,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:41,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46167231] [2023-02-15 22:49:41,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46167231] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:41,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:41,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 22:49:41,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561451319] [2023-02-15 22:49:41,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:41,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:49:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:41,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:49:41,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:49:41,510 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:42,931 INFO L93 Difference]: Finished difference Result 461 states and 558 transitions. [2023-02-15 22:49:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:49:42,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2023-02-15 22:49:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:42,933 INFO L225 Difference]: With dead ends: 461 [2023-02-15 22:49:42,933 INFO L226 Difference]: Without dead ends: 377 [2023-02-15 22:49:42,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=779, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 22:49:42,934 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 392 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 877 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:49:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-02-15 22:49:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 179. [2023-02-15 22:49:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 166 states have (on average 1.1626506024096386) internal successors, (193), 171 states have internal predecessors, (193), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2023-02-15 22:49:42,951 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 63 [2023-02-15 22:49:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:42,951 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2023-02-15 22:49:42,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.0) internal successors, (100), 20 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2023-02-15 22:49:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-15 22:49:42,952 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:42,952 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:42,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:43,160 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -331722330, now seen corresponding path program 2 times [2023-02-15 22:49:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:43,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186531243] [2023-02-15 22:49:43,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:49:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:43,163 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:43,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 (12)] Waiting until timeout for monitored process [2023-02-15 22:49:43,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:49:43,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:49:43,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:49:43,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 12 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:43,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 12 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:44,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186531243] [2023-02-15 22:49:44,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186531243] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:44,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:44,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 22:49:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668489047] [2023-02-15 22:49:44,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:44,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:49:44,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:49:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 22:49:44,190 INFO L87 Difference]: Start difference. First operand 179 states and 201 transitions. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:49:45,592 INFO L93 Difference]: Finished difference Result 530 states and 651 transitions. [2023-02-15 22:49:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 22:49:45,593 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 99 [2023-02-15 22:49:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:49:45,594 INFO L225 Difference]: With dead ends: 530 [2023-02-15 22:49:45,594 INFO L226 Difference]: Without dead ends: 440 [2023-02-15 22:49:45,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 22:49:45,596 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 605 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:49:45,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 2066 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:49:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-02-15 22:49:45,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 217. [2023-02-15 22:49:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 204 states have (on average 1.1568627450980393) internal successors, (236), 209 states have internal predecessors, (236), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 22:49:45,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 244 transitions. [2023-02-15 22:49:45,614 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 244 transitions. Word has length 99 [2023-02-15 22:49:45,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:49:45,614 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 244 transitions. [2023-02-15 22:49:45,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:49:45,615 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 244 transitions. [2023-02-15 22:49:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-02-15 22:49:45,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:49:45,615 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:49:45,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:49:45,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:45,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-15 22:49:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:49:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash 818718227, now seen corresponding path program 2 times [2023-02-15 22:49:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:49:45,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657595030] [2023-02-15 22:49:45,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:49:45,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:49:45,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:49:45,825 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:49:45,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:49:45,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:49:45,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:49:45,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 22:49:45,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:49:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 9 proven. 632 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:46,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:49:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 9 proven. 632 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:49:47,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:49:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657595030] [2023-02-15 22:49:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657595030] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:49:47,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:49:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2023-02-15 22:49:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925870673] [2023-02-15 22:49:47,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:49:47,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:49:47,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:49:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:49:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 22:49:47,775 INFO L87 Difference]: Start difference. First operand 217 states and 244 transitions. Second operand has 38 states, 38 states have (on average 5.0) internal successors, (190), 38 states have internal predecessors, (190), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)