./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 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_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:46:28,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:46:28,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:46:28,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:46:28,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:46:28,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:46:28,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:46:28,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:46:28,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:46:28,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:46:28,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:46:28,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:46:28,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:46:28,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:46:28,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:46:28,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:46:28,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:46:28,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:46:28,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:46:28,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:46:28,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:46:28,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:46:28,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:46:28,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:46:28,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:46:28,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:46:28,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:46:28,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:46:28,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:46:28,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:46:28,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:46:28,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:46:28,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:46:28,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:46:28,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:46:28,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:46:28,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:46:28,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:46:28,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:46:28,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:46:28,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:46:28,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:46:28,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-22 00:46:28,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:46:28,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:46:28,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:46:28,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:46:28,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:46:28,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:46:28,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:46:28,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:46:28,435 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:46:28,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:46:28,436 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 00:46:28,436 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:46:28,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:46:28,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 00:46:28,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:46:28,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:46:28,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:46:28,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:46:28,443 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:46:28,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 00:46:28,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:46:28,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:46:28,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:46:28,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:46:28,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:46:28,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:46:28,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:28,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:46:28,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:46:28,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:46:28,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:46:28,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:46:28,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:46:28,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2022-07-22 00:46:28,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:46:28,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:46:28,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:46:28,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:46:28,786 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:46:28,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-07-22 00:46:28,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6fd925/1212ac64607f4aeea5575ae2d592f928/FLAGdc52eec04 [2022-07-22 00:46:29,289 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:46:29,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-07-22 00:46:29,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6fd925/1212ac64607f4aeea5575ae2d592f928/FLAGdc52eec04 [2022-07-22 00:46:29,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a6fd925/1212ac64607f4aeea5575ae2d592f928 [2022-07-22 00:46:29,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:46:29,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:46:29,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:29,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:46:29,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:46:29,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0f980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29, skipping insertion in model container [2022-07-22 00:46:29,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:46:29,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:46:29,460 WARN L230 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_2a.c.cil.c[728,741] [2022-07-22 00:46:29,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:29,529 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:46:29,591 WARN L230 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_2a.c.cil.c[728,741] [2022-07-22 00:46:29,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:29,661 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:46:29,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29 WrapperNode [2022-07-22 00:46:29,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:29,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:29,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:46:29,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:46:29,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,728 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 192 [2022-07-22 00:46:29,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:29,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:46:29,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:46:29,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:46:29,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:46:29,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:46:29,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:46:29,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:46:29,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (1/1) ... [2022-07-22 00:46:29,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:29,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:29,816 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) [2022-07-22 00:46:29,842 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 [2022-07-22 00:46:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 00:46:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 00:46:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 00:46:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 00:46:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:46:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:46:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 00:46:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 00:46:29,961 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:46:29,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:46:30,358 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:46:30,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:46:30,368 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 00:46:30,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:30 BoogieIcfgContainer [2022-07-22 00:46:30,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:46:30,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:46:30,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:46:30,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:46:30,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:46:29" (1/3) ... [2022-07-22 00:46:30,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:30, skipping insertion in model container [2022-07-22 00:46:30,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:29" (2/3) ... [2022-07-22 00:46:30,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf6b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:30, skipping insertion in model container [2022-07-22 00:46:30,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:30" (3/3) ... [2022-07-22 00:46:30,389 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2022-07-22 00:46:30,405 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:46:30,405 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-07-22 00:46:30,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:46:30,495 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19b0a8f5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40d702f7 [2022-07-22 00:46:30,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-07-22 00:46:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 98 states have (on average 1.7857142857142858) internal successors, (175), 121 states have internal predecessors, (175), 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) [2022-07-22 00:46:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:30,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:30,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:30,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash -650612023, now seen corresponding path program 1 times [2022-07-22 00:46:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096526609] [2022-07-22 00:46:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:30,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096526609] [2022-07-22 00:46:30,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096526609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:30,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:30,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:46:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456804957] [2022-07-22 00:46:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:30,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 00:46:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 00:46:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:30,691 INFO L87 Difference]: Start difference. First operand has 128 states, 98 states have (on average 1.7857142857142858) internal successors, (175), 121 states have internal predecessors, (175), 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, 2 states have (on average 4.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) [2022-07-22 00:46:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:30,754 INFO L93 Difference]: Finished difference Result 251 states and 371 transitions. [2022-07-22 00:46:30,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 00:46:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.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 [2022-07-22 00:46:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:30,764 INFO L225 Difference]: With dead ends: 251 [2022-07-22 00:46:30,764 INFO L226 Difference]: Without dead ends: 105 [2022-07-22 00:46:30,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:30,777 INFO L413 NwaCegarLoop]: 168 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, 168 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 [2022-07-22 00:46:30,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-22 00:46:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-22 00:46:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.5875) internal successors, (127), 99 states have internal predecessors, (127), 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) [2022-07-22 00:46:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-07-22 00:46:30,829 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 9 [2022-07-22 00:46:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:30,829 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-07-22 00:46:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.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) [2022-07-22 00:46:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-07-22 00:46:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:30,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:30,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:30,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:46:30,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash -651553371, now seen corresponding path program 1 times [2022-07-22 00:46:30,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:30,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787665856] [2022-07-22 00:46:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:30,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787665856] [2022-07-22 00:46:30,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787665856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:30,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:30,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882490907] [2022-07-22 00:46:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:30,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:30,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:30,956 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. 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) [2022-07-22 00:46:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,088 INFO L93 Difference]: Finished difference Result 269 states and 363 transitions. [2022-07-22 00:46:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:31,088 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 [2022-07-22 00:46:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,091 INFO L225 Difference]: With dead ends: 269 [2022-07-22 00:46:31,091 INFO L226 Difference]: Without dead ends: 167 [2022-07-22 00:46:31,092 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 [2022-07-22 00:46:31,093 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 349 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-22 00:46:31,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2022-07-22 00:46:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.578125) internal successors, (202), 147 states have internal predecessors, (202), 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) [2022-07-22 00:46:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2022-07-22 00:46:31,106 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 9 [2022-07-22 00:46:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,107 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2022-07-22 00:46:31,107 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) [2022-07-22 00:46:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2022-07-22 00:46:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 00:46:31,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:46:31,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:31,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1699191166, now seen corresponding path program 1 times [2022-07-22 00:46:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:31,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44667529] [2022-07-22 00:46:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:31,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44667529] [2022-07-22 00:46:31,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44667529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:31,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:31,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892779441] [2022-07-22 00:46:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:31,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 00:46:31,149 INFO L87 Difference]: Start difference. First operand 154 states and 210 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-07-22 00:46:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,281 INFO L93 Difference]: Finished difference Result 189 states and 251 transitions. [2022-07-22 00:46:31,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:31,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-07-22 00:46:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,285 INFO L225 Difference]: With dead ends: 189 [2022-07-22 00:46:31,285 INFO L226 Difference]: Without dead ends: 186 [2022-07-22 00:46:31,286 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 [2022-07-22 00:46:31,290 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 161 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 468 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-22 00:46:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2022-07-22 00:46:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 135 states have (on average 1.5777777777777777) internal successors, (213), 154 states have internal predecessors, (213), 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) [2022-07-22 00:46:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 221 transitions. [2022-07-22 00:46:31,312 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 221 transitions. Word has length 13 [2022-07-22 00:46:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,313 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 221 transitions. [2022-07-22 00:46:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-07-22 00:46:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 221 transitions. [2022-07-22 00:46:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 00:46:31,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:46:31,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1135318715, now seen corresponding path program 1 times [2022-07-22 00:46:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795277386] [2022-07-22 00:46:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:31,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795277386] [2022-07-22 00:46:31,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795277386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:31,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:31,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069674327] [2022-07-22 00:46:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:31,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 00:46:31,371 INFO L87 Difference]: Start difference. First operand 161 states and 221 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) [2022-07-22 00:46:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,490 INFO L93 Difference]: Finished difference Result 354 states and 486 transitions. [2022-07-22 00:46:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:31,491 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 [2022-07-22 00:46:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,492 INFO L225 Difference]: With dead ends: 354 [2022-07-22 00:46:31,492 INFO L226 Difference]: Without dead ends: 196 [2022-07-22 00:46:31,493 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 [2022-07-22 00:46:31,494 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 165 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 459 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-22 00:46:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 165. [2022-07-22 00:46:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.5539568345323742) internal successors, (216), 158 states have internal predecessors, (216), 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) [2022-07-22 00:46:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 224 transitions. [2022-07-22 00:46:31,504 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 224 transitions. Word has length 14 [2022-07-22 00:46:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,504 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 224 transitions. [2022-07-22 00:46:31,504 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) [2022-07-22 00:46:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 224 transitions. [2022-07-22 00:46:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 00:46:31,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 00:46:31,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -783591725, now seen corresponding path program 1 times [2022-07-22 00:46:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:31,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663879308] [2022-07-22 00:46:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 00:46:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:31,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663879308] [2022-07-22 00:46:31,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663879308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:31,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:31,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:46:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942358485] [2022-07-22 00:46:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:31,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:31,534 INFO L87 Difference]: Start difference. First operand 165 states and 224 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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) [2022-07-22 00:46:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,566 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2022-07-22 00:46:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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 [2022-07-22 00:46:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,567 INFO L225 Difference]: With dead ends: 173 [2022-07-22 00:46:31,568 INFO L226 Difference]: Without dead ends: 172 [2022-07-22 00:46:31,568 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 [2022-07-22 00:46:31,569 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 5 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 248 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-22 00:46:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2022-07-22 00:46:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 156 states have internal predecessors, (213), 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) [2022-07-22 00:46:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 221 transitions. [2022-07-22 00:46:31,585 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 221 transitions. Word has length 15 [2022-07-22 00:46:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,586 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 221 transitions. [2022-07-22 00:46:31,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (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) [2022-07-22 00:46:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 221 transitions. [2022-07-22 00:46:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 00:46:31,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,587 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 00:46:31,587 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -783589465, now seen corresponding path program 1 times [2022-07-22 00:46:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144739209] [2022-07-22 00:46:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:31,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144739209] [2022-07-22 00:46:31,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144739209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:31,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768250973] [2022-07-22 00:46:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:31,652 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) [2022-07-22 00:46:31,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 00:46:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:31,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 00:46:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:31,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:31,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768250973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:31,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:31,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-22 00:46:31,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120890946] [2022-07-22 00:46:31,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:31,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:31,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:31,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:31,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:31,762 INFO L87 Difference]: Start difference. First operand 163 states and 221 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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) [2022-07-22 00:46:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:31,819 INFO L93 Difference]: Finished difference Result 201 states and 276 transitions. [2022-07-22 00:46:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 [2022-07-22 00:46:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:31,820 INFO L225 Difference]: With dead ends: 201 [2022-07-22 00:46:31,821 INFO L226 Difference]: Without dead ends: 199 [2022-07-22 00:46:31,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:31,822 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:31,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 391 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-22 00:46:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2022-07-22 00:46:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 158 states have internal predecessors, (215), 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) [2022-07-22 00:46:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2022-07-22 00:46:31,829 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 15 [2022-07-22 00:46:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:31,830 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2022-07-22 00:46:31,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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) [2022-07-22 00:46:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2022-07-22 00:46:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:46:31,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:31,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:31,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:32,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 00:46:32,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 842807383, now seen corresponding path program 1 times [2022-07-22 00:46:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735246896] [2022-07-22 00:46:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 00:46:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:32,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735246896] [2022-07-22 00:46:32,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735246896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:32,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:32,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:32,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946402283] [2022-07-22 00:46:32,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:32,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:32,095 INFO L87 Difference]: Start difference. First operand 165 states and 223 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) [2022-07-22 00:46:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:32,151 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2022-07-22 00:46:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:32,152 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 [2022-07-22 00:46:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:32,153 INFO L225 Difference]: With dead ends: 207 [2022-07-22 00:46:32,153 INFO L226 Difference]: Without dead ends: 204 [2022-07-22 00:46:32,154 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 [2022-07-22 00:46:32,154 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 27 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:32,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 370 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-22 00:46:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 170. [2022-07-22 00:46:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 163 states have internal predecessors, (223), 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) [2022-07-22 00:46:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2022-07-22 00:46:32,162 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 19 [2022-07-22 00:46:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:32,162 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2022-07-22 00:46:32,162 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) [2022-07-22 00:46:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2022-07-22 00:46:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-22 00:46:32,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:32,163 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:32,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 00:46:32,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1397629671, now seen corresponding path program 1 times [2022-07-22 00:46:32,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:32,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854915357] [2022-07-22 00:46:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854915357] [2022-07-22 00:46:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854915357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:32,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968716767] [2022-07-22 00:46:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:32,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:32,215 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) [2022-07-22 00:46:32,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 00:46:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:32,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:32,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:32,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968716767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:32,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:32,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504407016] [2022-07-22 00:46:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:32,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:32,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:32,304 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2022-07-22 00:46:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:32,394 INFO L93 Difference]: Finished difference Result 252 states and 350 transitions. [2022-07-22 00:46:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:32,395 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, (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 23 [2022-07-22 00:46:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:32,397 INFO L225 Difference]: With dead ends: 252 [2022-07-22 00:46:32,397 INFO L226 Difference]: Without dead ends: 249 [2022-07-22 00:46:32,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:32,398 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:32,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 365 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-22 00:46:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2022-07-22 00:46:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.5384615384615385) internal successors, (280), 199 states have internal predecessors, (280), 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) [2022-07-22 00:46:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-07-22 00:46:32,406 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 23 [2022-07-22 00:46:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:32,415 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-07-22 00:46:32,415 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, (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) [2022-07-22 00:46:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-07-22 00:46:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 00:46:32,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:32,416 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:32,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:32,639 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,SelfDestructingSolverStorable7 [2022-07-22 00:46:32,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -315199921, now seen corresponding path program 1 times [2022-07-22 00:46:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53918895] [2022-07-22 00:46:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:32,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53918895] [2022-07-22 00:46:32,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53918895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:32,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977541070] [2022-07-22 00:46:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:32,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:32,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:32,710 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) [2022-07-22 00:46:32,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 00:46:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:32,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:32,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:32,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:32,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977541070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:32,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:32,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:32,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63382498] [2022-07-22 00:46:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:32,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:32,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:32,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:32,800 INFO L87 Difference]: Start difference. First operand 207 states and 288 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, (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) [2022-07-22 00:46:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:32,880 INFO L93 Difference]: Finished difference Result 240 states and 329 transitions. [2022-07-22 00:46:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:32,881 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, (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 25 [2022-07-22 00:46:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:32,882 INFO L225 Difference]: With dead ends: 240 [2022-07-22 00:46:32,882 INFO L226 Difference]: Without dead ends: 237 [2022-07-22 00:46:32,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:32,883 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 168 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:32,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 375 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-22 00:46:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 199. [2022-07-22 00:46:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.5229885057471264) internal successors, (265), 191 states have internal predecessors, (265), 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) [2022-07-22 00:46:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2022-07-22 00:46:32,891 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 25 [2022-07-22 00:46:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:32,892 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2022-07-22 00:46:32,892 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, (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) [2022-07-22 00:46:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2022-07-22 00:46:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 00:46:32,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:32,893 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] [2022-07-22 00:46:32,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:33,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:33,113 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 309979375, now seen corresponding path program 1 times [2022-07-22 00:46:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:33,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447053127] [2022-07-22 00:46:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:46:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447053127] [2022-07-22 00:46:33,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447053127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613602803] [2022-07-22 00:46:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:33,194 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) [2022-07-22 00:46:33,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 00:46:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:33,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:46:33,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:33,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613602803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:33,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:33,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013900537] [2022-07-22 00:46:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:33,309 INFO L87 Difference]: Start difference. First operand 199 states and 273 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, (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) [2022-07-22 00:46:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:33,404 INFO L93 Difference]: Finished difference Result 229 states and 315 transitions. [2022-07-22 00:46:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:33,404 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, (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 30 [2022-07-22 00:46:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:33,405 INFO L225 Difference]: With dead ends: 229 [2022-07-22 00:46:33,405 INFO L226 Difference]: Without dead ends: 226 [2022-07-22 00:46:33,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:33,406 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 186 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:33,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 354 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-22 00:46:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 187. [2022-07-22 00:46:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 165 states have (on average 1.4848484848484849) internal successors, (245), 179 states have internal predecessors, (245), 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) [2022-07-22 00:46:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2022-07-22 00:46:33,417 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 30 [2022-07-22 00:46:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:33,417 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2022-07-22 00:46:33,417 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, (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) [2022-07-22 00:46:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2022-07-22 00:46:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 00:46:33,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:33,418 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, 1] [2022-07-22 00:46:33,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:33,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:33,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1870081449, now seen corresponding path program 1 times [2022-07-22 00:46:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:33,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306739770] [2022-07-22 00:46:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:46:33,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:33,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306739770] [2022-07-22 00:46:33,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306739770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:33,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821564887] [2022-07-22 00:46:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:33,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:33,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:33,691 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) [2022-07-22 00:46:33,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 00:46:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:33,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:33,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-22 00:46:33,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:33,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821564887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:33,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:33,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169625798] [2022-07-22 00:46:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:33,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:33,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:33,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:33,804 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-07-22 00:46:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:33,889 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2022-07-22 00:46:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:33,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 32 [2022-07-22 00:46:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:33,892 INFO L225 Difference]: With dead ends: 217 [2022-07-22 00:46:33,892 INFO L226 Difference]: Without dead ends: 214 [2022-07-22 00:46:33,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:33,893 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:33,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 360 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-22 00:46:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 176. [2022-07-22 00:46:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.464968152866242) internal successors, (230), 168 states have internal predecessors, (230), 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) [2022-07-22 00:46:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2022-07-22 00:46:33,902 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 32 [2022-07-22 00:46:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:33,902 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2022-07-22 00:46:33,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-07-22 00:46:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2022-07-22 00:46:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 00:46:33,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:33,908 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, 1, 1] [2022-07-22 00:46:33,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:34,123 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,SelfDestructingSolverStorable10 [2022-07-22 00:46:34,124 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:34,124 INFO L85 PathProgramCache]: Analyzing trace with hash -392453626, now seen corresponding path program 1 times [2022-07-22 00:46:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:34,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502973700] [2022-07-22 00:46:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 00:46:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 00:46:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 00:46:34,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:34,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502973700] [2022-07-22 00:46:34,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502973700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:34,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083361570] [2022-07-22 00:46:34,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:34,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:34,204 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) [2022-07-22 00:46:34,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 00:46:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:34,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 00:46:34,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 00:46:34,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 00:46:34,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083361570] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:34,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:34,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 8] total 19 [2022-07-22 00:46:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775529766] [2022-07-22 00:46:34,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:34,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 00:46:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 00:46:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-22 00:46:34,489 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 00:46:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:35,193 INFO L93 Difference]: Finished difference Result 793 states and 1039 transitions. [2022-07-22 00:46:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-22 00:46:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-07-22 00:46:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:35,202 INFO L225 Difference]: With dead ends: 793 [2022-07-22 00:46:35,202 INFO L226 Difference]: Without dead ends: 531 [2022-07-22 00:46:35,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 00:46:35,203 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 509 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:35,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1560 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-22 00:46:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 199. [2022-07-22 00:46:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 179 states have (on average 1.4189944134078212) internal successors, (254), 190 states have internal predecessors, (254), 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) [2022-07-22 00:46:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 262 transitions. [2022-07-22 00:46:35,242 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 262 transitions. Word has length 37 [2022-07-22 00:46:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:35,243 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 262 transitions. [2022-07-22 00:46:35,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-22 00:46:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2022-07-22 00:46:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 00:46:35,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:35,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:35,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:35,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:35,470 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1867874532, now seen corresponding path program 1 times [2022-07-22 00:46:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:35,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653277142] [2022-07-22 00:46:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 00:46:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 00:46:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:35,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653277142] [2022-07-22 00:46:35,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653277142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:35,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:35,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 00:46:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049859018] [2022-07-22 00:46:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:35,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 00:46:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 00:46:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 00:46:35,589 INFO L87 Difference]: Start difference. First operand 199 states and 262 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-22 00:46:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:35,700 INFO L93 Difference]: Finished difference Result 437 states and 543 transitions. [2022-07-22 00:46:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:46:35,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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 57 [2022-07-22 00:46:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:35,703 INFO L225 Difference]: With dead ends: 437 [2022-07-22 00:46:35,703 INFO L226 Difference]: Without dead ends: 370 [2022-07-22 00:46:35,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:46:35,704 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 229 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:35,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 903 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-22 00:46:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 199. [2022-07-22 00:46:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 179 states have (on average 1.4078212290502794) internal successors, (252), 190 states have internal predecessors, (252), 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) [2022-07-22 00:46:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2022-07-22 00:46:35,715 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 57 [2022-07-22 00:46:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:35,716 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2022-07-22 00:46:35,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-22 00:46:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2022-07-22 00:46:35,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 00:46:35,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:35,717 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, 1, 1, 1, 1] [2022-07-22 00:46:35,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 00:46:35,718 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:35,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:35,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1303124915, now seen corresponding path program 2 times [2022-07-22 00:46:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:35,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646580881] [2022-07-22 00:46:35,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:35,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 00:46:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:35,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646580881] [2022-07-22 00:46:35,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646580881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:35,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525982286] [2022-07-22 00:46:35,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:46:35,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:35,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:35,796 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) [2022-07-22 00:46:35,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 00:46:35,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 00:46:35,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:46:35,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 00:46:35,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 00:46:35,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:35,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525982286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:35,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:35,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-07-22 00:46:35,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201267367] [2022-07-22 00:46:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:35,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:46:35,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:35,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:46:35,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:46:35,923 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-22 00:46:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:36,026 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2022-07-22 00:46:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:46:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 61 [2022-07-22 00:46:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:36,028 INFO L225 Difference]: With dead ends: 373 [2022-07-22 00:46:36,028 INFO L226 Difference]: Without dead ends: 321 [2022-07-22 00:46:36,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-22 00:46:36,029 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 249 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:36,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1023 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-22 00:46:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230. [2022-07-22 00:46:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 209 states have (on average 1.3827751196172249) internal successors, (289), 220 states have internal predecessors, (289), 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) [2022-07-22 00:46:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 298 transitions. [2022-07-22 00:46:36,046 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 298 transitions. Word has length 61 [2022-07-22 00:46:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:36,047 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 298 transitions. [2022-07-22 00:46:36,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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) [2022-07-22 00:46:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 298 transitions. [2022-07-22 00:46:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 00:46:36,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:36,049 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, 1, 1, 1, 1] [2022-07-22 00:46:36,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:36,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1303126837, now seen corresponding path program 1 times [2022-07-22 00:46:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:36,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345519056] [2022-07-22 00:46:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 00:46:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 00:46:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:36,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:36,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345519056] [2022-07-22 00:46:36,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345519056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:36,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244579606] [2022-07-22 00:46:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:36,356 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) [2022-07-22 00:46:36,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 00:46:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:36,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 00:46:36,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 00:46:36,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244579606] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:36,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:36,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-07-22 00:46:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915383424] [2022-07-22 00:46:36,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:36,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 00:46:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 00:46:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:46:36,595 INFO L87 Difference]: Start difference. First operand 230 states and 298 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:46:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:37,118 INFO L93 Difference]: Finished difference Result 1139 states and 1499 transitions. [2022-07-22 00:46:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 00:46:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-22 00:46:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:37,122 INFO L225 Difference]: With dead ends: 1139 [2022-07-22 00:46:37,122 INFO L226 Difference]: Without dead ends: 945 [2022-07-22 00:46:37,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=710, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 00:46:37,125 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 666 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:37,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 872 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 00:46:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-22 00:46:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 250. [2022-07-22 00:46:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 229 states have (on average 1.3668122270742358) internal successors, (313), 240 states have internal predecessors, (313), 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) [2022-07-22 00:46:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2022-07-22 00:46:37,153 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 61 [2022-07-22 00:46:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:37,153 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2022-07-22 00:46:37,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:46:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2022-07-22 00:46:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 00:46:37,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:37,159 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:37,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:37,375 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,SelfDestructingSolverStorable14 [2022-07-22 00:46:37,376 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1609979175, now seen corresponding path program 1 times [2022-07-22 00:46:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205619591] [2022-07-22 00:46:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 00:46:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 00:46:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205619591] [2022-07-22 00:46:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205619591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902842216] [2022-07-22 00:46:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:37,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:37,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:37,483 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) [2022-07-22 00:46:37,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 00:46:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:37,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 00:46:37,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 00:46:37,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 00:46:37,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902842216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:37,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:37,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-07-22 00:46:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045166924] [2022-07-22 00:46:37,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:37,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 00:46:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 00:46:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:46:37,720 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-22 00:46:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:38,664 INFO L93 Difference]: Finished difference Result 719 states and 913 transitions. [2022-07-22 00:46:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-22 00:46:38,665 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2022-07-22 00:46:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:38,668 INFO L225 Difference]: With dead ends: 719 [2022-07-22 00:46:38,668 INFO L226 Difference]: Without dead ends: 512 [2022-07-22 00:46:38,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=565, Invalid=1985, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 00:46:38,669 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 578 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:38,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 741 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-22 00:46:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 250. [2022-07-22 00:46:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 229 states have (on average 1.3493449781659388) internal successors, (309), 240 states have internal predecessors, (309), 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) [2022-07-22 00:46:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-07-22 00:46:38,692 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 64 [2022-07-22 00:46:38,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:38,692 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-07-22 00:46:38,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-22 00:46:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-07-22 00:46:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-22 00:46:38,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:38,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:38,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:38,915 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,SelfDestructingSolverStorable15 [2022-07-22 00:46:38,915 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 768500551, now seen corresponding path program 1 times [2022-07-22 00:46:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570389978] [2022-07-22 00:46:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 00:46:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 00:46:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:39,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570389978] [2022-07-22 00:46:39,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570389978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033115595] [2022-07-22 00:46:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:39,017 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) [2022-07-22 00:46:39,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 00:46:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:39,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 00:46:39,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 00:46:39,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:39,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033115595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:39,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:39,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-22 00:46:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252457634] [2022-07-22 00:46:39,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:39,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 00:46:39,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:39,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 00:46:39,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:46:39,284 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:46:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:41,394 INFO L93 Difference]: Finished difference Result 894 states and 1137 transitions. [2022-07-22 00:46:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 00:46:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-22 00:46:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:41,399 INFO L225 Difference]: With dead ends: 894 [2022-07-22 00:46:41,399 INFO L226 Difference]: Without dead ends: 644 [2022-07-22 00:46:41,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-22 00:46:41,401 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 569 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:41,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 707 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-07-22 00:46:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 281. [2022-07-22 00:46:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.3076923076923077) internal successors, (340), 271 states have internal predecessors, (340), 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) [2022-07-22 00:46:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 349 transitions. [2022-07-22 00:46:41,434 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 349 transitions. Word has length 71 [2022-07-22 00:46:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:41,435 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 349 transitions. [2022-07-22 00:46:41,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:46:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 349 transitions. [2022-07-22 00:46:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-22 00:46:41,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:41,436 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, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:41,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 00:46:41,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1043554459, now seen corresponding path program 1 times [2022-07-22 00:46:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456318521] [2022-07-22 00:46:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 00:46:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 00:46:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456318521] [2022-07-22 00:46:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456318521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078701729] [2022-07-22 00:46:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:41,786 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) [2022-07-22 00:46:41,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 00:46:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 00:46:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 00:46:41,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:42,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078701729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:42,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:42,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-22 00:46:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489372134] [2022-07-22 00:46:42,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 00:46:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 00:46:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2022-07-22 00:46:42,245 INFO L87 Difference]: Start difference. First operand 281 states and 349 transitions. Second operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:46:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:43,370 INFO L93 Difference]: Finished difference Result 1899 states and 2505 transitions. [2022-07-22 00:46:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-22 00:46:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-07-22 00:46:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:43,376 INFO L225 Difference]: With dead ends: 1899 [2022-07-22 00:46:43,376 INFO L226 Difference]: Without dead ends: 1663 [2022-07-22 00:46:43,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1154, Invalid=2386, Unknown=0, NotChecked=0, Total=3540 [2022-07-22 00:46:43,378 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1418 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:43,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1024 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2022-07-22 00:46:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 332. [2022-07-22 00:46:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.2958199356913183) internal successors, (403), 322 states have internal predecessors, (403), 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) [2022-07-22 00:46:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 412 transitions. [2022-07-22 00:46:43,431 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 412 transitions. Word has length 83 [2022-07-22 00:46:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:43,431 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 412 transitions. [2022-07-22 00:46:43,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:46:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 412 transitions. [2022-07-22 00:46:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 00:46:43,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:43,433 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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] [2022-07-22 00:46:43,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:43,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 00:46:43,647 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:43,648 INFO L85 PathProgramCache]: Analyzing trace with hash -602965433, now seen corresponding path program 2 times [2022-07-22 00:46:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:43,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35553938] [2022-07-22 00:46:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:43,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:43,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 00:46:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 00:46:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35553938] [2022-07-22 00:46:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35553938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850008466] [2022-07-22 00:46:43,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:46:43,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:43,913 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) [2022-07-22 00:46:43,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 00:46:43,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 00:46:43,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:46:43,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 00:46:43,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 00:46:44,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:44,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850008466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:44,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:44,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2022-07-22 00:46:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347987708] [2022-07-22 00:46:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:44,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:46:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:46:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-22 00:46:44,081 INFO L87 Difference]: Start difference. First operand 332 states and 412 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-07-22 00:46:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:44,221 INFO L93 Difference]: Finished difference Result 423 states and 515 transitions. [2022-07-22 00:46:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:46:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 91 [2022-07-22 00:46:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:44,224 INFO L225 Difference]: With dead ends: 423 [2022-07-22 00:46:44,224 INFO L226 Difference]: Without dead ends: 421 [2022-07-22 00:46:44,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-07-22 00:46:44,224 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 240 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:44,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1018 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-22 00:46:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 332. [2022-07-22 00:46:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.2958199356913183) internal successors, (403), 322 states have internal predecessors, (403), 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) [2022-07-22 00:46:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 412 transitions. [2022-07-22 00:46:44,248 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 412 transitions. Word has length 91 [2022-07-22 00:46:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:44,248 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 412 transitions. [2022-07-22 00:46:44,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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) [2022-07-22 00:46:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 412 transitions. [2022-07-22 00:46:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 00:46:44,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:44,250 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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] [2022-07-22 00:46:44,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:44,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:44,455 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1412310137, now seen corresponding path program 1 times [2022-07-22 00:46:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:44,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039512904] [2022-07-22 00:46:44,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 00:46:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 00:46:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 00:46:44,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:44,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039512904] [2022-07-22 00:46:44,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039512904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:44,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947494286] [2022-07-22 00:46:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:44,531 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) [2022-07-22 00:46:44,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 00:46:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:44,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 00:46:44,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 00:46:44,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-22 00:46:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947494286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:44,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-22 00:46:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491718333] [2022-07-22 00:46:44,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 00:46:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 00:46:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:46:44,732 INFO L87 Difference]: Start difference. First operand 332 states and 412 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:44,940 INFO L93 Difference]: Finished difference Result 710 states and 862 transitions. [2022-07-22 00:46:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 00:46:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-07-22 00:46:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:44,949 INFO L225 Difference]: With dead ends: 710 [2022-07-22 00:46:44,949 INFO L226 Difference]: Without dead ends: 646 [2022-07-22 00:46:44,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-22 00:46:44,951 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 460 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:44,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1633 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-07-22 00:46:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 359. [2022-07-22 00:46:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 336 states have (on average 1.2857142857142858) internal successors, (432), 346 states have internal predecessors, (432), 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) [2022-07-22 00:46:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 445 transitions. [2022-07-22 00:46:44,983 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 445 transitions. Word has length 91 [2022-07-22 00:46:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:44,984 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 445 transitions. [2022-07-22 00:46:44,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:46:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 445 transitions. [2022-07-22 00:46:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 00:46:44,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:44,985 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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] [2022-07-22 00:46:45,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:45,195 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,SelfDestructingSolverStorable19 [2022-07-22 00:46:45,196 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:46:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1412312059, now seen corresponding path program 1 times [2022-07-22 00:46:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:45,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325084921] [2022-07-22 00:46:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:46:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 00:46:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 00:46:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325084921] [2022-07-22 00:46:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325084921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435542781] [2022-07-22 00:46:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:45,393 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) [2022-07-22 00:46:45,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 00:46:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:45,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 00:46:45,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 00:46:45,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:46:46,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435542781] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:46,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:46,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-22 00:46:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339931408] [2022-07-22 00:46:46,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:46,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-22 00:46:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-22 00:46:46,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-22 00:46:46,188 INFO L87 Difference]: Start difference. First operand 359 states and 445 transitions. Second operand has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:47:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:06,431 INFO L93 Difference]: Finished difference Result 1238 states and 1594 transitions. [2022-07-22 00:47:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-22 00:47:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-07-22 00:47:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:06,435 INFO L225 Difference]: With dead ends: 1238 [2022-07-22 00:47:06,435 INFO L226 Difference]: Without dead ends: 919 [2022-07-22 00:47:06,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=996, Invalid=2909, Unknown=1, NotChecked=0, Total=3906 [2022-07-22 00:47:06,439 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1052 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1765 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:06,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1765 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 00:47:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-07-22 00:47:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 388. [2022-07-22 00:47:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 365 states have (on average 1.252054794520548) internal successors, (457), 375 states have internal predecessors, (457), 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) [2022-07-22 00:47:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 470 transitions. [2022-07-22 00:47:06,482 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 470 transitions. Word has length 91 [2022-07-22 00:47:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:06,482 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 470 transitions. [2022-07-22 00:47:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:47:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 470 transitions. [2022-07-22 00:47:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-22 00:47:06,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:06,486 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 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] [2022-07-22 00:47:06,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-22 00:47:06,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:06,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2013964067, now seen corresponding path program 1 times [2022-07-22 00:47:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597017874] [2022-07-22 00:47:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 00:47:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 00:47:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:47:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:06,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597017874] [2022-07-22 00:47:06,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597017874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:06,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819464688] [2022-07-22 00:47:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:06,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:47:06,974 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) [2022-07-22 00:47:06,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-22 00:47:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:07,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 00:47:07,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:47:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 00:47:07,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:47:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:47:07,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819464688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:47:07,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:47:07,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-07-22 00:47:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318716155] [2022-07-22 00:47:07,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:47:07,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-22 00:47:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-22 00:47:07,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=1702, Unknown=0, NotChecked=0, Total=2550 [2022-07-22 00:47:07,949 INFO L87 Difference]: Start difference. First operand 388 states and 470 transitions. Second operand has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:47:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:11,109 INFO L93 Difference]: Finished difference Result 3503 states and 4731 transitions. [2022-07-22 00:47:11,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-07-22 00:47:11,109 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 123 [2022-07-22 00:47:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:11,121 INFO L225 Difference]: With dead ends: 3503 [2022-07-22 00:47:11,121 INFO L226 Difference]: Without dead ends: 3200 [2022-07-22 00:47:11,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4229, Invalid=8881, Unknown=0, NotChecked=0, Total=13110 [2022-07-22 00:47:11,125 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4468 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:11,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 1267 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 00:47:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2022-07-22 00:47:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 479. [2022-07-22 00:47:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 466 states have internal predecessors, (568), 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) [2022-07-22 00:47:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 581 transitions. [2022-07-22 00:47:11,220 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 581 transitions. Word has length 123 [2022-07-22 00:47:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:11,220 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 581 transitions. [2022-07-22 00:47:11,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-22 00:47:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 581 transitions. [2022-07-22 00:47:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-22 00:47:11,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:11,222 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 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] [2022-07-22 00:47:11,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-22 00:47:11,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:11,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1790935557, now seen corresponding path program 2 times [2022-07-22 00:47:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:11,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986554677] [2022-07-22 00:47:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 4 proven. 465 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 00:47:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986554677] [2022-07-22 00:47:11,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986554677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:11,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847449309] [2022-07-22 00:47:11,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:47:11,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:11,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:47:11,784 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) [2022-07-22 00:47:11,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-22 00:47:11,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 00:47:11,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:47:11,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 00:47:11,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:47:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-22 00:47:11,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:47:11,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847449309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:47:11,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:47:11,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2022-07-22 00:47:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029998138] [2022-07-22 00:47:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 00:47:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 00:47:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-22 00:47:11,989 INFO L87 Difference]: Start difference. First operand 479 states and 581 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2022-07-22 00:47:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:12,224 INFO L93 Difference]: Finished difference Result 609 states and 729 transitions. [2022-07-22 00:47:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:47:12,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 131 [2022-07-22 00:47:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:12,227 INFO L225 Difference]: With dead ends: 609 [2022-07-22 00:47:12,227 INFO L226 Difference]: Without dead ends: 562 [2022-07-22 00:47:12,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2022-07-22 00:47:12,228 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 180 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:12,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1115 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:47:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-22 00:47:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 477. [2022-07-22 00:47:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 454 states have (on average 1.2422907488986785) internal successors, (564), 464 states have internal predecessors, (564), 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) [2022-07-22 00:47:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 577 transitions. [2022-07-22 00:47:12,273 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 577 transitions. Word has length 131 [2022-07-22 00:47:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:12,273 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 577 transitions. [2022-07-22 00:47:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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) [2022-07-22 00:47:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 577 transitions. [2022-07-22 00:47:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 00:47:12,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:12,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:12,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-22 00:47:12,479 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,SelfDestructingSolverStorable22 [2022-07-22 00:47:12,479 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -702012822, now seen corresponding path program 1 times [2022-07-22 00:47:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:12,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104394076] [2022-07-22 00:47:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-22 00:47:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:12,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104394076] [2022-07-22 00:47:12,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104394076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:47:12,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:47:12,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 00:47:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683675231] [2022-07-22 00:47:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:12,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:47:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:47:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 00:47:12,565 INFO L87 Difference]: Start difference. First operand 477 states and 577 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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) [2022-07-22 00:47:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:12,737 INFO L93 Difference]: Finished difference Result 874 states and 1074 transitions. [2022-07-22 00:47:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 00:47:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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 137 [2022-07-22 00:47:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:12,740 INFO L225 Difference]: With dead ends: 874 [2022-07-22 00:47:12,740 INFO L226 Difference]: Without dead ends: 585 [2022-07-22 00:47:12,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 00:47:12,742 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:12,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 803 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:47:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-07-22 00:47:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 482. [2022-07-22 00:47:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 459 states have (on average 1.2396514161220045) internal successors, (569), 469 states have internal predecessors, (569), 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) [2022-07-22 00:47:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 582 transitions. [2022-07-22 00:47:12,797 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 582 transitions. Word has length 137 [2022-07-22 00:47:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:12,797 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 582 transitions. [2022-07-22 00:47:12,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 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) [2022-07-22 00:47:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 582 transitions. [2022-07-22 00:47:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 00:47:12,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:12,799 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:12,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-22 00:47:12,799 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -867497325, now seen corresponding path program 1 times [2022-07-22 00:47:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034751589] [2022-07-22 00:47:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-22 00:47:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:12,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034751589] [2022-07-22 00:47:12,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034751589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:47:12,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:47:12,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 00:47:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774983864] [2022-07-22 00:47:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:12,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:47:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:12,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:47:12,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:47:12,915 INFO L87 Difference]: Start difference. First operand 482 states and 582 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-07-22 00:47:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:13,229 INFO L93 Difference]: Finished difference Result 925 states and 1099 transitions. [2022-07-22 00:47:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 00:47:13,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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 138 [2022-07-22 00:47:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:13,233 INFO L225 Difference]: With dead ends: 925 [2022-07-22 00:47:13,233 INFO L226 Difference]: Without dead ends: 875 [2022-07-22 00:47:13,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-07-22 00:47:13,236 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 572 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:13,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1122 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:47:13,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-07-22 00:47:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 522. [2022-07-22 00:47:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 498 states have (on average 1.2409638554216869) internal successors, (618), 507 states have internal predecessors, (618), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:47:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 633 transitions. [2022-07-22 00:47:13,295 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 633 transitions. Word has length 138 [2022-07-22 00:47:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:13,296 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 633 transitions. [2022-07-22 00:47:13,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 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) [2022-07-22 00:47:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 633 transitions. [2022-07-22 00:47:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 00:47:13,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:13,301 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:13,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 00:47:13,301 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -867499247, now seen corresponding path program 1 times [2022-07-22 00:47:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:13,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722788881] [2022-07-22 00:47:13,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 00:47:13,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722788881] [2022-07-22 00:47:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722788881] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946537061] [2022-07-22 00:47:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:13,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:47:13,684 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) [2022-07-22 00:47:13,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 00:47:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:13,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 00:47:13,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:47:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-22 00:47:13,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:47:13,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946537061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:47:13,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:47:13,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 27 [2022-07-22 00:47:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762941468] [2022-07-22 00:47:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:13,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:47:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:47:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-07-22 00:47:13,962 INFO L87 Difference]: Start difference. First operand 522 states and 633 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-07-22 00:47:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:14,386 INFO L93 Difference]: Finished difference Result 1007 states and 1192 transitions. [2022-07-22 00:47:14,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 00:47:14,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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 138 [2022-07-22 00:47:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:14,390 INFO L225 Difference]: With dead ends: 1007 [2022-07-22 00:47:14,390 INFO L226 Difference]: Without dead ends: 950 [2022-07-22 00:47:14,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2022-07-22 00:47:14,391 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 333 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:14,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 2773 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:47:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-22 00:47:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 538. [2022-07-22 00:47:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 513 states have (on average 1.2378167641325537) internal successors, (635), 521 states have internal predecessors, (635), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-22 00:47:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 652 transitions. [2022-07-22 00:47:14,470 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 652 transitions. Word has length 138 [2022-07-22 00:47:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:14,471 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 652 transitions. [2022-07-22 00:47:14,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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) [2022-07-22 00:47:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 652 transitions. [2022-07-22 00:47:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 00:47:14,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:14,473 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:14,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-22 00:47:14,689 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,SelfDestructingSolverStorable25 [2022-07-22 00:47:14,690 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1676845873, now seen corresponding path program 1 times [2022-07-22 00:47:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73469221] [2022-07-22 00:47:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 00:47:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73469221] [2022-07-22 00:47:15,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73469221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:15,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185658939] [2022-07-22 00:47:15,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:15,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:15,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:47:15,051 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) [2022-07-22 00:47:15,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-22 00:47:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:15,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 00:47:15,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:47:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2022-07-22 00:47:15,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:47:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-22 00:47:15,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185658939] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:15,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 00:47:15,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 10] total 33 [2022-07-22 00:47:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204691075] [2022-07-22 00:47:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:47:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:47:15,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2022-07-22 00:47:15,760 INFO L87 Difference]: Start difference. First operand 538 states and 652 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-22 00:47:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:16,025 INFO L93 Difference]: Finished difference Result 647 states and 775 transitions. [2022-07-22 00:47:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:47:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 138 [2022-07-22 00:47:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:16,028 INFO L225 Difference]: With dead ends: 647 [2022-07-22 00:47:16,028 INFO L226 Difference]: Without dead ends: 569 [2022-07-22 00:47:16,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 00:47:16,029 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 49 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:16,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 885 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:47:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-22 00:47:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 522. [2022-07-22 00:47:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 498 states have (on average 1.2389558232931728) internal successors, (617), 507 states have internal predecessors, (617), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:47:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 632 transitions. [2022-07-22 00:47:16,082 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 632 transitions. Word has length 138 [2022-07-22 00:47:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:16,083 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 632 transitions. [2022-07-22 00:47:16,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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) [2022-07-22 00:47:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 632 transitions. [2022-07-22 00:47:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-22 00:47:16,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:16,085 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:16,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-22 00:47:16,299 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,SelfDestructingSolverStorable26 [2022-07-22 00:47:16,299 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1902021283, now seen corresponding path program 1 times [2022-07-22 00:47:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:16,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239093210] [2022-07-22 00:47:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-22 00:47:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239093210] [2022-07-22 00:47:16,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239093210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:47:16,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:47:16,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 00:47:16,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87856056] [2022-07-22 00:47:16,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:47:16,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 00:47:16,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 00:47:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:47:16,407 INFO L87 Difference]: Start difference. First operand 522 states and 632 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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) [2022-07-22 00:47:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:47:16,688 INFO L93 Difference]: Finished difference Result 1101 states and 1337 transitions. [2022-07-22 00:47:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:47:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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 139 [2022-07-22 00:47:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:47:16,693 INFO L225 Difference]: With dead ends: 1101 [2022-07-22 00:47:16,693 INFO L226 Difference]: Without dead ends: 772 [2022-07-22 00:47:16,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-22 00:47:16,694 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 215 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:47:16,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1257 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:47:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-07-22 00:47:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 529. [2022-07-22 00:47:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 505 states have (on average 1.2396039603960396) internal successors, (626), 514 states have internal predecessors, (626), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:47:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 641 transitions. [2022-07-22 00:47:16,747 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 641 transitions. Word has length 139 [2022-07-22 00:47:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:47:16,747 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 641 transitions. [2022-07-22 00:47:16,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 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) [2022-07-22 00:47:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 641 transitions. [2022-07-22 00:47:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 00:47:16,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:47:16,749 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:47:16,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 00:47:16,749 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:47:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:47:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1167417324, now seen corresponding path program 1 times [2022-07-22 00:47:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:47:16,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713801430] [2022-07-22 00:47:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:47:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:47:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:16,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:47:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 00:47:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 00:47:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 00:47:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:47:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713801430] [2022-07-22 00:47:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713801430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:47:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507261510] [2022-07-22 00:47:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:47:17,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:47:17,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:47:17,080 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) [2022-07-22 00:47:17,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-22 00:47:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:47:17,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 00:47:17,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:47:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 36 proven. 455 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 00:47:17,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:47:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 00:47:18,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507261510] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:47:18,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:47:18,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-22 00:47:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90568999] [2022-07-22 00:47:18,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:47:18,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-22 00:47:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:47:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-22 00:47:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-22 00:47:18,435 INFO L87 Difference]: Start difference. First operand 529 states and 641 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:48:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:09,605 INFO L93 Difference]: Finished difference Result 1949 states and 2483 transitions. [2022-07-22 00:48:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-22 00:48:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 140 [2022-07-22 00:48:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:09,618 INFO L225 Difference]: With dead ends: 1949 [2022-07-22 00:48:09,619 INFO L226 Difference]: Without dead ends: 1546 [2022-07-22 00:48:09,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3167 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=2904, Invalid=9965, Unknown=13, NotChecked=0, Total=12882 [2022-07-22 00:48:09,623 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 1826 mSDsluCounter, 5251 mSDsCounter, 0 mSdLazyCounter, 4946 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 5423 SdHoareTripleChecker+Invalid, 5901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 4946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:09,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 5423 Invalid, 5901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 4946 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-22 00:48:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-07-22 00:48:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 609. [2022-07-22 00:48:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 585 states have (on average 1.217094017094017) internal successors, (712), 594 states have internal predecessors, (712), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 727 transitions. [2022-07-22 00:48:09,701 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 727 transitions. Word has length 140 [2022-07-22 00:48:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:09,702 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 727 transitions. [2022-07-22 00:48:09,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-22 00:48:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 727 transitions. [2022-07-22 00:48:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-22 00:48:09,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:09,704 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:09,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-22 00:48:09,909 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 [2022-07-22 00:48:09,909 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1725785708, now seen corresponding path program 2 times [2022-07-22 00:48:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210573696] [2022-07-22 00:48:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-22 00:48:10,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:10,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210573696] [2022-07-22 00:48:10,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210573696] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:48:10,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047513014] [2022-07-22 00:48:10,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 00:48:10,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:10,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:48:10,073 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) [2022-07-22 00:48:10,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-22 00:48:10,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 00:48:10,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 00:48:10,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 00:48:10,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:48:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-22 00:48:10,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:48:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-22 00:48:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047513014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:48:10,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:48:10,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-22 00:48:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101250703] [2022-07-22 00:48:10,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:48:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 00:48:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 00:48:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-22 00:48:10,328 INFO L87 Difference]: Start difference. First operand 609 states and 727 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:48:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:10,515 INFO L93 Difference]: Finished difference Result 813 states and 968 transitions. [2022-07-22 00:48:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:48:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 190 [2022-07-22 00:48:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:10,518 INFO L225 Difference]: With dead ends: 813 [2022-07-22 00:48:10,518 INFO L226 Difference]: Without dead ends: 746 [2022-07-22 00:48:10,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-22 00:48:10,519 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 229 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:10,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1143 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:48:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-22 00:48:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 607. [2022-07-22 00:48:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 583 states have (on average 1.2126929674099485) internal successors, (707), 592 states have internal predecessors, (707), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 722 transitions. [2022-07-22 00:48:10,607 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 722 transitions. Word has length 190 [2022-07-22 00:48:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:10,607 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 722 transitions. [2022-07-22 00:48:10,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 00:48:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 722 transitions. [2022-07-22 00:48:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-22 00:48:10,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:10,610 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:10,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-22 00:48:10,823 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 [2022-07-22 00:48:10,823 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash 951811193, now seen corresponding path program 1 times [2022-07-22 00:48:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578624514] [2022-07-22 00:48:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:10,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578624514] [2022-07-22 00:48:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578624514] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:48:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799948276] [2022-07-22 00:48:10,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:48:10,932 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:48:10,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-22 00:48:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 00:48:11,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:48:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:11,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:48:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-22 00:48:11,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799948276] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 00:48:11,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 00:48:11,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 8] total 10 [2022-07-22 00:48:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867790122] [2022-07-22 00:48:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:48:11,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:48:11,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:48:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:48:11,133 INFO L87 Difference]: Start difference. First operand 607 states and 722 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-07-22 00:48:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:11,221 INFO L93 Difference]: Finished difference Result 685 states and 811 transitions. [2022-07-22 00:48:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:48:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 196 [2022-07-22 00:48:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:11,223 INFO L225 Difference]: With dead ends: 685 [2022-07-22 00:48:11,223 INFO L226 Difference]: Without dead ends: 634 [2022-07-22 00:48:11,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:48:11,224 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:11,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:48:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-22 00:48:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2022-07-22 00:48:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 601 states have (on average 1.2096505823627288) internal successors, (727), 610 states have internal predecessors, (727), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 742 transitions. [2022-07-22 00:48:11,295 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 742 transitions. Word has length 196 [2022-07-22 00:48:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:11,295 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 742 transitions. [2022-07-22 00:48:11,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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) [2022-07-22 00:48:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 742 transitions. [2022-07-22 00:48:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-22 00:48:11,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:11,297 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:11,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-22 00:48:11,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:11,503 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1209976631, now seen corresponding path program 1 times [2022-07-22 00:48:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:11,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503113394] [2022-07-22 00:48:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:11,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:11,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503113394] [2022-07-22 00:48:11,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503113394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:48:11,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:48:11,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 00:48:11,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571075959] [2022-07-22 00:48:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:48:11,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 00:48:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 00:48:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 00:48:11,611 INFO L87 Difference]: Start difference. First operand 625 states and 742 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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) [2022-07-22 00:48:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:11,816 INFO L93 Difference]: Finished difference Result 824 states and 972 transitions. [2022-07-22 00:48:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 00:48:11,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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 196 [2022-07-22 00:48:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:11,819 INFO L225 Difference]: With dead ends: 824 [2022-07-22 00:48:11,819 INFO L226 Difference]: Without dead ends: 794 [2022-07-22 00:48:11,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-22 00:48:11,821 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 209 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:11,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 979 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:48:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-22 00:48:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 631. [2022-07-22 00:48:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 607 states have (on average 1.2092257001647446) internal successors, (734), 616 states have internal predecessors, (734), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 749 transitions. [2022-07-22 00:48:11,921 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 749 transitions. Word has length 196 [2022-07-22 00:48:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:11,924 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 749 transitions. [2022-07-22 00:48:11,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 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) [2022-07-22 00:48:11,925 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 749 transitions. [2022-07-22 00:48:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-22 00:48:11,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:11,928 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:11,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 00:48:11,929 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1209976693, now seen corresponding path program 1 times [2022-07-22 00:48:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:11,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284840512] [2022-07-22 00:48:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:12,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284840512] [2022-07-22 00:48:12,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284840512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:48:12,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790134939] [2022-07-22 00:48:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:48:12,155 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:48:12,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-22 00:48:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:12,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 00:48:12,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:48:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:12,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:48:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790134939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:48:12,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:48:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2022-07-22 00:48:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439206631] [2022-07-22 00:48:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:48:12,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 00:48:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 00:48:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-22 00:48:12,566 INFO L87 Difference]: Start difference. First operand 631 states and 749 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2022-07-22 00:48:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:12,833 INFO L93 Difference]: Finished difference Result 734 states and 868 transitions. [2022-07-22 00:48:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 00:48:12,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 196 [2022-07-22 00:48:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:12,835 INFO L225 Difference]: With dead ends: 734 [2022-07-22 00:48:12,836 INFO L226 Difference]: Without dead ends: 730 [2022-07-22 00:48:12,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-22 00:48:12,836 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 212 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 845 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:48:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-07-22 00:48:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 662. [2022-07-22 00:48:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 638 states have (on average 1.2225705329153604) internal successors, (780), 647 states have internal predecessors, (780), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2022-07-22 00:48:12,921 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 196 [2022-07-22 00:48:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:12,921 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2022-07-22 00:48:12,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2022-07-22 00:48:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2022-07-22 00:48:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-22 00:48:12,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:12,923 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:12,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-22 00:48:13,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:13,147 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1145427899, now seen corresponding path program 1 times [2022-07-22 00:48:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:13,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701964928] [2022-07-22 00:48:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:13,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-22 00:48:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701964928] [2022-07-22 00:48:13,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701964928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:48:13,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:48:13,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 00:48:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970658968] [2022-07-22 00:48:13,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:48:13,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 00:48:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 00:48:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 00:48:13,371 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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) [2022-07-22 00:48:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:13,816 INFO L93 Difference]: Finished difference Result 795 states and 942 transitions. [2022-07-22 00:48:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 00:48:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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 197 [2022-07-22 00:48:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:13,819 INFO L225 Difference]: With dead ends: 795 [2022-07-22 00:48:13,819 INFO L226 Difference]: Without dead ends: 781 [2022-07-22 00:48:13,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-22 00:48:13,820 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 228 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:13,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1173 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:48:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-22 00:48:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 654. [2022-07-22 00:48:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 630 states have (on average 1.2095238095238094) internal successors, (762), 639 states have internal predecessors, (762), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 777 transitions. [2022-07-22 00:48:13,903 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 777 transitions. Word has length 197 [2022-07-22 00:48:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 777 transitions. [2022-07-22 00:48:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 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) [2022-07-22 00:48:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 777 transitions. [2022-07-22 00:48:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-22 00:48:13,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:13,906 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:13,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-22 00:48:13,906 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:13,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:13,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1080534868, now seen corresponding path program 1 times [2022-07-22 00:48:13,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:13,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045911011] [2022-07-22 00:48:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-22 00:48:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-22 00:48:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045911011] [2022-07-22 00:48:14,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045911011] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:48:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472116624] [2022-07-22 00:48:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:14,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:48:14,087 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:48:14,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-22 00:48:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:14,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 00:48:14,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:48:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2022-07-22 00:48:14,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:48:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-22 00:48:14,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472116624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:48:14,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:48:14,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 20 [2022-07-22 00:48:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266602192] [2022-07-22 00:48:14,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:48:14,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 00:48:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 00:48:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2022-07-22 00:48:14,506 INFO L87 Difference]: Start difference. First operand 654 states and 777 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 00:48:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:15,327 INFO L93 Difference]: Finished difference Result 1136 states and 1357 transitions. [2022-07-22 00:48:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 00:48:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 197 [2022-07-22 00:48:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:15,331 INFO L225 Difference]: With dead ends: 1136 [2022-07-22 00:48:15,331 INFO L226 Difference]: Without dead ends: 939 [2022-07-22 00:48:15,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2022-07-22 00:48:15,333 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 406 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:15,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:48:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-22 00:48:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 648. [2022-07-22 00:48:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 624 states have (on average 1.2083333333333333) internal successors, (754), 633 states have internal predecessors, (754), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 769 transitions. [2022-07-22 00:48:15,413 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 769 transitions. Word has length 197 [2022-07-22 00:48:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:15,413 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 769 transitions. [2022-07-22 00:48:15,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-22 00:48:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 769 transitions. [2022-07-22 00:48:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-22 00:48:15,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:15,415 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:15,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-22 00:48:15,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:48:15,622 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1148526217, now seen corresponding path program 1 times [2022-07-22 00:48:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:15,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984970201] [2022-07-22 00:48:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:48:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 00:48:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 00:48:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:16,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-22 00:48:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:48:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-07-22 00:48:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:48:16,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984970201] [2022-07-22 00:48:16,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984970201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:48:16,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:48:16,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-22 00:48:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858540929] [2022-07-22 00:48:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:48:16,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 00:48:16,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:48:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 00:48:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-22 00:48:16,027 INFO L87 Difference]: Start difference. First operand 648 states and 769 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 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) [2022-07-22 00:48:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:48:16,739 INFO L93 Difference]: Finished difference Result 843 states and 1001 transitions. [2022-07-22 00:48:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 00:48:16,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 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 198 [2022-07-22 00:48:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:48:16,742 INFO L225 Difference]: With dead ends: 843 [2022-07-22 00:48:16,742 INFO L226 Difference]: Without dead ends: 839 [2022-07-22 00:48:16,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-07-22 00:48:16,743 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 312 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:48:16,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1494 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:48:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-22 00:48:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 674. [2022-07-22 00:48:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 651 states have (on average 1.2058371735791091) internal successors, (785), 659 states have internal predecessors, (785), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-22 00:48:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 800 transitions. [2022-07-22 00:48:16,813 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 800 transitions. Word has length 198 [2022-07-22 00:48:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:48:16,814 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 800 transitions. [2022-07-22 00:48:16,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 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) [2022-07-22 00:48:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 800 transitions. [2022-07-22 00:48:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-22 00:48:16,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:48:16,816 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:16,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-22 00:48:16,816 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-22 00:48:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:48:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 540150599, now seen corresponding path program 1 times [2022-07-22 00:48:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:48:16,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554082346] [2022-07-22 00:48:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:48:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:48:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:48:16,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 00:48:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:48:16,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 00:48:16,932 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 00:48:16,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2022-07-22 00:48:16,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2022-07-22 00:48:16,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2022-07-22 00:48:16,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2022-07-22 00:48:16,938 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2022-07-22 00:48:16,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2022-07-22 00:48:16,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2022-07-22 00:48:16,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-22 00:48:16,943 INFO L356 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, 1, 1, 1, 1, 1, 1] [2022-07-22 00:48:16,947 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:48:17,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:48:17 BoogieIcfgContainer [2022-07-22 00:48:17,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:48:17,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:48:17,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:48:17,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:48:17,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:30" (3/4) ... [2022-07-22 00:48:17,040 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 00:48:17,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:48:17,041 INFO L158 Benchmark]: Toolchain (without parser) took 107720.48ms. Allocated memory was 65.0MB in the beginning and 283.1MB in the end (delta: 218.1MB). Free memory was 45.2MB in the beginning and 167.7MB in the end (delta: -122.4MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2022-07-22 00:48:17,041 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:48:17,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.22ms. Allocated memory is still 65.0MB. Free memory was 45.0MB in the beginning and 46.2MB in the end (delta: -1.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 00:48:17,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.18ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:48:17,042 INFO L158 Benchmark]: Boogie Preprocessor took 51.28ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 42.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 00:48:17,042 INFO L158 Benchmark]: RCFGBuilder took 591.09ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 61.2MB in the end (delta: -19.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-07-22 00:48:17,042 INFO L158 Benchmark]: TraceAbstraction took 106652.87ms. Allocated memory was 86.0MB in the beginning and 283.1MB in the end (delta: 197.1MB). Free memory was 60.8MB in the beginning and 167.7MB in the end (delta: -106.9MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2022-07-22 00:48:17,043 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 283.1MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:48:17,043 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.09ms. Allocated memory is still 65.0MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.22ms. Allocated memory is still 65.0MB. Free memory was 45.0MB in the beginning and 46.2MB in the end (delta: -1.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.18ms. Allocated memory is still 65.0MB. Free memory was 46.2MB in the beginning and 43.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.28ms. Allocated memory is still 65.0MB. Free memory was 43.9MB in the beginning and 42.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 591.09ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 42.1MB in the beginning and 61.2MB in the end (delta: -19.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 106652.87ms. Allocated memory was 86.0MB in the beginning and 283.1MB in the end (delta: 197.1MB). Free memory was 60.8MB in the beginning and 167.7MB in the end (delta: -106.9MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 283.1MB. Free memory is still 167.7MB. 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. 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 sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-1, eb=-127] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=1744830464, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L78] __retres4 = res VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L80] return (__retres4); VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=2147483646, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=2147483646, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L78] __retres4 = res VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, \result=36028799166447615, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L241] RET, EXPR base2flt(mb, eb) VAL [a=2147483646, base2flt(mb, eb)=36028799166447615, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(a < zero) VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L246] COND TRUE a > zero [L247] tmp = 1 VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=1, zero=0] [L251] sa = tmp VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, sa=1, tmp=1, zero=0] [L254] 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)=2147483646, \old(b)=2147483647, a=2147483646, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L165] COND FALSE !(! b) VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] - 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: 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. - 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, 128 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 106.5s, OverallIterations: 37, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 86.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16487 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16475 mSDsluCounter, 38458 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33364 mSDsCounter, 3130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13235 IncrementalHoareTripleChecker+Invalid, 16365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3130 mSolverCounterUnsat, 5094 mSDtfsCounter, 13235 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4784 GetRequests, 3915 SyntacticMatches, 4 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10983 ImplicationChecksByTransitivity, 77.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=36, InterpolantAutomatonStates: 653, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 10318 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 5788 NumberOfCodeBlocks, 5578 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 6999 ConstructedInterpolants, 0 QuantifiedInterpolants, 20671 SizeOfPredicates, 76 NumberOfNonLiveVariables, 5246 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 72 InterpolantComputations, 25 PerfectInterpolantSequences, 24796/29925 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 [2022-07-22 00:48:17,162 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 No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample