./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5317dae 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/byte_add-2.i -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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 04:02:09,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:02:09,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:02:09,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:02:09,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:02:09,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:02:09,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:02:09,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:02:09,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:02:09,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:02:09,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:02:09,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:02:09,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:02:09,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:02:09,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:02:09,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:02:09,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:02:09,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:02:09,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:02:09,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:02:09,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:02:09,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:02:09,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:02:09,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:02:09,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:02:09,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:02:09,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:02:09,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:02:09,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:02:09,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:02:09,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:02:09,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:02:09,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:02:09,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:02:09,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:02:09,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:02:09,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:02:09,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:02:09,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:02:09,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:02:09,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:02:09,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-16 04:02:09,437 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:02:09,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:02:09,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:02:09,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:02:09,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 04:02:09,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 04:02:09,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:02:09,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:02:09,440 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:02:09,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:02:09,441 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 04:02:09,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:02:09,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:02:09,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 04:02:09,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:02:09,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:02:09,443 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:02:09,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 04:02:09,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:02:09,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:02:09,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 04:02:09,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:02:09,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:02:09,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 04:02:09,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 04:02:09,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:02:09,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 04:02:09,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 04:02:09,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 04:02:09,446 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 04:02:09,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 04:02:09,447 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 04:02:09,447 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2023-02-16 04:02:09,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:02:09,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:02:09,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:02:09,697 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:02:09,697 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:02:09,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2023-02-16 04:02:10,906 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:02:11,099 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:02:11,100 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2023-02-16 04:02:11,111 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3a69241/fc222aaa93654551aacd729ca39c85d5/FLAG2724478ff [2023-02-16 04:02:11,463 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3a69241/fc222aaa93654551aacd729ca39c85d5 [2023-02-16 04:02:11,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:02:11,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:02:11,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:02:11,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:02:11,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:02:11,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723974c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11, skipping insertion in model container [2023-02-16 04:02:11,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:02:11,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:02:11,622 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2023-02-16 04:02:11,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:02:11,666 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:02:11,677 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2023-02-16 04:02:11,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:02:11,709 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:02:11,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11 WrapperNode [2023-02-16 04:02:11,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:02:11,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:02:11,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:02:11,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:02:11,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,758 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2023-02-16 04:02:11,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:02:11,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:02:11,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:02:11,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:02:11,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,789 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:02:11,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:02:11,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:02:11,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:02:11,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (1/1) ... [2023-02-16 04:02:11,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 04:02:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:11,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 04:02:11,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 04:02:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 04:02:11,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 04:02:11,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:02:11,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:02:11,939 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:02:11,941 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:02:12,402 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:02:12,408 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:02:12,412 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 04:02:12,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:02:12 BoogieIcfgContainer [2023-02-16 04:02:12,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:02:12,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 04:02:12,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 04:02:12,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 04:02:12,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 04:02:11" (1/3) ... [2023-02-16 04:02:12,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baa7b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:02:12, skipping insertion in model container [2023-02-16 04:02:12,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:02:11" (2/3) ... [2023-02-16 04:02:12,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baa7b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 04:02:12, skipping insertion in model container [2023-02-16 04:02:12,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:02:12" (3/3) ... [2023-02-16 04:02:12,427 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2023-02-16 04:02:12,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 04:02:12,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-16 04:02:12,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 04:02:12,503 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@728076af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 04:02:12,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-16 04:02:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:12,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 04:02:12,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:12,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 04:02:12,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-16 04:02:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:12,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774384584] [2023-02-16 04:02:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:12,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774384584] [2023-02-16 04:02:12,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774384584] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:12,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:12,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-16 04:02:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075347231] [2023-02-16 04:02:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 04:02:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 04:02:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:02:12,727 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:12,751 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-16 04:02:12,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 04:02:12,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-16 04:02:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:12,760 INFO L225 Difference]: With dead ends: 153 [2023-02-16 04:02:12,760 INFO L226 Difference]: Without dead ends: 76 [2023-02-16 04:02:12,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 04:02:12,766 INFO L413 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:12,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:02:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-16 04:02:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-16 04:02:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-16 04:02:12,808 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-16 04:02:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:12,810 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-16 04:02:12,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-16 04:02:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 04:02:12,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:12,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:12,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 04:02:12,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-16 04:02:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746108740] [2023-02-16 04:02:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:12,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746108740] [2023-02-16 04:02:12,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746108740] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:12,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:12,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:02:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754916786] [2023-02-16 04:02:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:12,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:02:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:02:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:12,963 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:13,119 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-16 04:02:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:02:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 04:02:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:13,121 INFO L225 Difference]: With dead ends: 162 [2023-02-16 04:02:13,121 INFO L226 Difference]: Without dead ends: 108 [2023-02-16 04:02:13,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:13,123 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:13,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-16 04:02:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-16 04:02:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-16 04:02:13,133 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-16 04:02:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:13,133 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-16 04:02:13,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-16 04:02:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 04:02:13,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:13,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:13,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 04:02:13,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-16 04:02:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573934038] [2023-02-16 04:02:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:02:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:13,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573934038] [2023-02-16 04:02:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573934038] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:13,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:13,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:02:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861874555] [2023-02-16 04:02:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:13,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:13,332 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:13,519 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2023-02-16 04:02:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-16 04:02:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:13,527 INFO L225 Difference]: With dead ends: 268 [2023-02-16 04:02:13,527 INFO L226 Difference]: Without dead ends: 194 [2023-02-16 04:02:13,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:02:13,534 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 147 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:13,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 336 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-16 04:02:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2023-02-16 04:02:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-02-16 04:02:13,545 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 24 [2023-02-16 04:02:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:13,545 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-02-16 04:02:13,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-02-16 04:02:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 04:02:13,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:13,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:13,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 04:02:13,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1685366660, now seen corresponding path program 1 times [2023-02-16 04:02:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:13,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514081388] [2023-02-16 04:02:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 04:02:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514081388] [2023-02-16 04:02:13,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514081388] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:13,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:13,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:02:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90374548] [2023-02-16 04:02:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:13,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:13,728 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:13,895 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2023-02-16 04:02:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-16 04:02:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:13,899 INFO L225 Difference]: With dead ends: 267 [2023-02-16 04:02:13,899 INFO L226 Difference]: Without dead ends: 200 [2023-02-16 04:02:13,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:02:13,907 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 136 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:13,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 326 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-16 04:02:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 130. [2023-02-16 04:02:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2023-02-16 04:02:13,922 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 27 [2023-02-16 04:02:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:13,923 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2023-02-16 04:02:13,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2023-02-16 04:02:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 04:02:13,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:13,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:13,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 04:02:13,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052269, now seen corresponding path program 1 times [2023-02-16 04:02:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:13,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561822244] [2023-02-16 04:02:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:14,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561822244] [2023-02-16 04:02:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561822244] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306976536] [2023-02-16 04:02:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:14,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:14,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:14,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 04:02:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:14,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:02:14,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:14,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:14,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306976536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:14,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:14,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-16 04:02:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095054530] [2023-02-16 04:02:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:14,197 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:14,348 INFO L93 Difference]: Finished difference Result 239 states and 340 transitions. [2023-02-16 04:02:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-16 04:02:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:14,352 INFO L225 Difference]: With dead ends: 239 [2023-02-16 04:02:14,352 INFO L226 Difference]: Without dead ends: 185 [2023-02-16 04:02:14,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:14,353 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:14,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-16 04:02:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2023-02-16 04:02:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.286624203821656) internal successors, (202), 157 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2023-02-16 04:02:14,363 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 30 [2023-02-16 04:02:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:14,363 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-16 04:02:14,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2023-02-16 04:02:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 04:02:14,365 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:14,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:14,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 04:02:14,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:14,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1107213899, now seen corresponding path program 1 times [2023-02-16 04:02:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:14,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939123450] [2023-02-16 04:02:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:14,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939123450] [2023-02-16 04:02:14,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939123450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:14,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462383253] [2023-02-16 04:02:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:14,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:14,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 04:02:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:14,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:02:14,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 04:02:16,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:16,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462383253] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:16,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:16,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-16 04:02:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153496415] [2023-02-16 04:02:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:16,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2023-02-16 04:02:16,824 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:18,180 INFO L93 Difference]: Finished difference Result 325 states and 444 transitions. [2023-02-16 04:02:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 04:02:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:18,182 INFO L225 Difference]: With dead ends: 325 [2023-02-16 04:02:18,182 INFO L226 Difference]: Without dead ends: 220 [2023-02-16 04:02:18,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2023-02-16 04:02:18,183 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:18,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 239 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 04:02:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-16 04:02:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2023-02-16 04:02:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2023-02-16 04:02:18,193 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 37 [2023-02-16 04:02:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:18,193 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2023-02-16 04:02:18,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2023-02-16 04:02:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 04:02:18,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:18,195 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-16 04:02:18,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:18,406 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,SelfDestructingSolverStorable5 [2023-02-16 04:02:18,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:18,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash -756901417, now seen corresponding path program 1 times [2023-02-16 04:02:18,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:18,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071703193] [2023-02-16 04:02:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:02:18,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:18,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071703193] [2023-02-16 04:02:18,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071703193] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591062243] [2023-02-16 04:02:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:18,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:18,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:18,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 04:02:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:18,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 04:02:18,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 04:02:18,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:18,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591062243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:18,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:18,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-16 04:02:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413325486] [2023-02-16 04:02:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:18,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:18,664 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:18,865 INFO L93 Difference]: Finished difference Result 381 states and 510 transitions. [2023-02-16 04:02:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-16 04:02:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:18,867 INFO L225 Difference]: With dead ends: 381 [2023-02-16 04:02:18,867 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 04:02:18,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:18,868 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:18,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 252 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 04:02:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2023-02-16 04:02:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.267605633802817) internal successors, (270), 213 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2023-02-16 04:02:18,878 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 44 [2023-02-16 04:02:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:18,878 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2023-02-16 04:02:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2023-02-16 04:02:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 04:02:18,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:18,880 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:18,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:19,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:19,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1675390727, now seen corresponding path program 1 times [2023-02-16 04:02:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:19,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337454919] [2023-02-16 04:02:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 04:02:19,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:19,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337454919] [2023-02-16 04:02:19,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337454919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:19,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:19,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:02:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202821265] [2023-02-16 04:02:19,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:19,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:02:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:02:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:19,191 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:19,202 INFO L93 Difference]: Finished difference Result 255 states and 315 transitions. [2023-02-16 04:02:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:02:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-02-16 04:02:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:19,205 INFO L225 Difference]: With dead ends: 255 [2023-02-16 04:02:19,205 INFO L226 Difference]: Without dead ends: 188 [2023-02-16 04:02:19,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:19,208 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:19,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:02:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-16 04:02:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-02-16 04:02:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 187 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2023-02-16 04:02:19,218 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 51 [2023-02-16 04:02:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:19,219 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2023-02-16 04:02:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2023-02-16 04:02:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 04:02:19,225 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:19,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 04:02:19,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash 174943707, now seen corresponding path program 1 times [2023-02-16 04:02:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811779367] [2023-02-16 04:02:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-02-16 04:02:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811779367] [2023-02-16 04:02:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811779367] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:19,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:19,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:02:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123724036] [2023-02-16 04:02:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:19,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:02:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:19,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:02:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:02:19,364 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:19,503 INFO L93 Difference]: Finished difference Result 534 states and 680 transitions. [2023-02-16 04:02:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 04:02:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2023-02-16 04:02:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:19,505 INFO L225 Difference]: With dead ends: 534 [2023-02-16 04:02:19,505 INFO L226 Difference]: Without dead ends: 397 [2023-02-16 04:02:19,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:19,506 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 227 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:19,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 174 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-16 04:02:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 228. [2023-02-16 04:02:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.2555066079295154) internal successors, (285), 227 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2023-02-16 04:02:19,517 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 63 [2023-02-16 04:02:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:19,517 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2023-02-16 04:02:19,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2023-02-16 04:02:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-16 04:02:19,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:19,519 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 04:02:19,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -340799825, now seen corresponding path program 1 times [2023-02-16 04:02:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923246659] [2023-02-16 04:02:19,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 04:02:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:19,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923246659] [2023-02-16 04:02:19,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923246659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:19,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:19,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:02:19,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724099021] [2023-02-16 04:02:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:19,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:19,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:19,617 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:19,683 INFO L93 Difference]: Finished difference Result 507 states and 631 transitions. [2023-02-16 04:02:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-02-16 04:02:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:19,685 INFO L225 Difference]: With dead ends: 507 [2023-02-16 04:02:19,686 INFO L226 Difference]: Without dead ends: 330 [2023-02-16 04:02:19,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:19,687 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:19,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 351 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-02-16 04:02:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2023-02-16 04:02:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 243 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2023-02-16 04:02:19,695 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 72 [2023-02-16 04:02:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:19,695 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2023-02-16 04:02:19,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2023-02-16 04:02:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-16 04:02:19,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:19,705 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:19,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 04:02:19,706 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1227237688, now seen corresponding path program 1 times [2023-02-16 04:02:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:19,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683639804] [2023-02-16 04:02:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 04:02:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:19,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683639804] [2023-02-16 04:02:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683639804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:19,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:19,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:02:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618325833] [2023-02-16 04:02:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:19,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:02:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:19,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:02:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:19,830 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:20,091 INFO L93 Difference]: Finished difference Result 695 states and 896 transitions. [2023-02-16 04:02:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:02:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-16 04:02:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:20,094 INFO L225 Difference]: With dead ends: 695 [2023-02-16 04:02:20,094 INFO L226 Difference]: Without dead ends: 497 [2023-02-16 04:02:20,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:20,095 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 195 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:20,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 360 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-02-16 04:02:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 398. [2023-02-16 04:02:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2896725440806045) internal successors, (512), 397 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 512 transitions. [2023-02-16 04:02:20,107 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 512 transitions. Word has length 76 [2023-02-16 04:02:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:20,107 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 512 transitions. [2023-02-16 04:02:20,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 512 transitions. [2023-02-16 04:02:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-16 04:02:20,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:20,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:20,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 04:02:20,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1202412060, now seen corresponding path program 1 times [2023-02-16 04:02:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:20,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383389373] [2023-02-16 04:02:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-16 04:02:20,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:20,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383389373] [2023-02-16 04:02:20,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383389373] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:20,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090837484] [2023-02-16 04:02:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:20,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:20,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:20,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 04:02:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:20,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:02:20,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:02:20,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:20,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090837484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:20,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:20,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-16 04:02:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937249312] [2023-02-16 04:02:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:20,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:20,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:20,308 INFO L87 Difference]: Start difference. First operand 398 states and 512 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:20,420 INFO L93 Difference]: Finished difference Result 1072 states and 1374 transitions. [2023-02-16 04:02:20,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:20,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-16 04:02:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:20,423 INFO L225 Difference]: With dead ends: 1072 [2023-02-16 04:02:20,423 INFO L226 Difference]: Without dead ends: 688 [2023-02-16 04:02:20,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:02:20,424 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 95 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:20,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 192 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:20,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-02-16 04:02:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 551. [2023-02-16 04:02:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2023-02-16 04:02:20,441 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 76 [2023-02-16 04:02:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:20,441 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2023-02-16 04:02:20,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2023-02-16 04:02:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-16 04:02:20,442 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:20,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:20,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:20,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:20,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash -426464219, now seen corresponding path program 1 times [2023-02-16 04:02:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:20,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245118846] [2023-02-16 04:02:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:20,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 04:02:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:20,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245118846] [2023-02-16 04:02:20,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245118846] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:20,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:20,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:02:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771900143] [2023-02-16 04:02:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:20,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:02:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:02:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:20,761 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:21,016 INFO L93 Difference]: Finished difference Result 1336 states and 1716 transitions. [2023-02-16 04:02:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:02:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-16 04:02:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:21,019 INFO L225 Difference]: With dead ends: 1336 [2023-02-16 04:02:21,019 INFO L226 Difference]: Without dead ends: 801 [2023-02-16 04:02:21,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:21,021 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 342 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:21,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 234 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2023-02-16 04:02:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 673. [2023-02-16 04:02:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2946428571428572) internal successors, (870), 672 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 870 transitions. [2023-02-16 04:02:21,041 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 870 transitions. Word has length 76 [2023-02-16 04:02:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:21,041 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 870 transitions. [2023-02-16 04:02:21,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 870 transitions. [2023-02-16 04:02:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-16 04:02:21,043 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:21,043 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:21,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 04:02:21,043 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1084235769, now seen corresponding path program 1 times [2023-02-16 04:02:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:21,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140781538] [2023-02-16 04:02:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-16 04:02:21,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:21,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140781538] [2023-02-16 04:02:21,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140781538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:21,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:21,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:02:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615096774] [2023-02-16 04:02:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:21,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 04:02:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:02:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:21,121 INFO L87 Difference]: Start difference. First operand 673 states and 870 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:21,159 INFO L93 Difference]: Finished difference Result 1293 states and 1676 transitions. [2023-02-16 04:02:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:02:21,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-02-16 04:02:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:21,162 INFO L225 Difference]: With dead ends: 1293 [2023-02-16 04:02:21,162 INFO L226 Difference]: Without dead ends: 673 [2023-02-16 04:02:21,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:02:21,164 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:21,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 04:02:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2023-02-16 04:02:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2023-02-16 04:02:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2619047619047619) internal successors, (848), 672 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 848 transitions. [2023-02-16 04:02:21,182 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 848 transitions. Word has length 80 [2023-02-16 04:02:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:21,183 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 848 transitions. [2023-02-16 04:02:21,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 848 transitions. [2023-02-16 04:02:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 04:02:21,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:21,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:21,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 04:02:21,185 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 564827417, now seen corresponding path program 1 times [2023-02-16 04:02:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:21,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139179920] [2023-02-16 04:02:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 04:02:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:21,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139179920] [2023-02-16 04:02:21,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139179920] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:21,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219152555] [2023-02-16 04:02:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:21,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:21,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:21,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 04:02:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:21,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 04:02:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 04:02:21,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:02:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 04:02:21,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219152555] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:02:21,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:02:21,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-02-16 04:02:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543412258] [2023-02-16 04:02:21,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:02:21,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:02:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:21,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:02:21,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:02:21,579 INFO L87 Difference]: Start difference. First operand 673 states and 848 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:23,115 INFO L93 Difference]: Finished difference Result 4048 states and 4946 transitions. [2023-02-16 04:02:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 04:02:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2023-02-16 04:02:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:23,126 INFO L225 Difference]: With dead ends: 4048 [2023-02-16 04:02:23,127 INFO L226 Difference]: Without dead ends: 3332 [2023-02-16 04:02:23,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2023-02-16 04:02:23,139 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 771 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:23,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 950 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-16 04:02:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2023-02-16 04:02:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 962. [2023-02-16 04:02:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3621227887617064) internal successors, (1309), 961 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1309 transitions. [2023-02-16 04:02:23,185 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1309 transitions. Word has length 81 [2023-02-16 04:02:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:23,185 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1309 transitions. [2023-02-16 04:02:23,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1309 transitions. [2023-02-16 04:02:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 04:02:23,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:23,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:23,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:23,395 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,SelfDestructingSolverStorable14 [2023-02-16 04:02:23,395 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:23,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1642726455, now seen corresponding path program 1 times [2023-02-16 04:02:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:23,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98796764] [2023-02-16 04:02:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-16 04:02:23,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:23,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98796764] [2023-02-16 04:02:23,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98796764] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:23,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:23,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:02:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72286090] [2023-02-16 04:02:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:02:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:02:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:23,555 INFO L87 Difference]: Start difference. First operand 962 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:23,936 INFO L93 Difference]: Finished difference Result 2317 states and 3129 transitions. [2023-02-16 04:02:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:02:23,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2023-02-16 04:02:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:23,940 INFO L225 Difference]: With dead ends: 2317 [2023-02-16 04:02:23,941 INFO L226 Difference]: Without dead ends: 1287 [2023-02-16 04:02:23,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:02:23,942 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 277 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:23,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 353 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:02:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2023-02-16 04:02:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1153. [2023-02-16 04:02:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3628472222222223) internal successors, (1570), 1152 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1570 transitions. [2023-02-16 04:02:23,978 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1570 transitions. Word has length 81 [2023-02-16 04:02:23,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:23,979 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1570 transitions. [2023-02-16 04:02:23,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:23,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1570 transitions. [2023-02-16 04:02:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 04:02:23,980 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:23,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:23,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 04:02:23,981 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -927103410, now seen corresponding path program 1 times [2023-02-16 04:02:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:23,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4119989] [2023-02-16 04:02:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:23,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:02:24,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:24,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4119989] [2023-02-16 04:02:24,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4119989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:24,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:24,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:02:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047995556] [2023-02-16 04:02:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:24,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:02:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:24,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:02:24,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:24,140 INFO L87 Difference]: Start difference. First operand 1153 states and 1570 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:24,533 INFO L93 Difference]: Finished difference Result 2633 states and 3566 transitions. [2023-02-16 04:02:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:02:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2023-02-16 04:02:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:24,538 INFO L225 Difference]: With dead ends: 2633 [2023-02-16 04:02:24,538 INFO L226 Difference]: Without dead ends: 1459 [2023-02-16 04:02:24,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-16 04:02:24,540 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 308 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:24,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 357 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 04:02:24,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2023-02-16 04:02:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1325. [2023-02-16 04:02:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-16 04:02:24,585 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 81 [2023-02-16 04:02:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:24,585 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-16 04:02:24,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-16 04:02:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-16 04:02:24,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:24,589 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:24,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 04:02:24,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2023-02-16 04:02:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:24,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292128683] [2023-02-16 04:02:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-16 04:02:24,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292128683] [2023-02-16 04:02:24,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292128683] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:24,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:24,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:02:24,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146029182] [2023-02-16 04:02:24,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:24,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:02:24,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:02:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:02:24,774 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:25,097 INFO L93 Difference]: Finished difference Result 4160 states and 5660 transitions. [2023-02-16 04:02:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:02:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-02-16 04:02:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:25,110 INFO L225 Difference]: With dead ends: 4160 [2023-02-16 04:02:25,111 INFO L226 Difference]: Without dead ends: 3965 [2023-02-16 04:02:25,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:25,113 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 279 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:25,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 494 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2023-02-16 04:02:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 1325. [2023-02-16 04:02:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-16 04:02:25,179 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2023-02-16 04:02:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:25,179 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-16 04:02:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-16 04:02:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-16 04:02:25,181 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:25,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 04:02:25,181 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 629870863, now seen corresponding path program 1 times [2023-02-16 04:02:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475911132] [2023-02-16 04:02:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-16 04:02:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:25,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475911132] [2023-02-16 04:02:25,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475911132] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:25,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:25,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 04:02:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122431626] [2023-02-16 04:02:25,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:25,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:02:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:25,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:02:25,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 04:02:25,341 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:25,670 INFO L93 Difference]: Finished difference Result 4152 states and 5648 transitions. [2023-02-16 04:02:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:02:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-02-16 04:02:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:25,681 INFO L225 Difference]: With dead ends: 4152 [2023-02-16 04:02:25,682 INFO L226 Difference]: Without dead ends: 3948 [2023-02-16 04:02:25,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:25,683 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 241 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:25,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 444 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2023-02-16 04:02:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 1325. [2023-02-16 04:02:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-16 04:02:25,753 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2023-02-16 04:02:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:25,754 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-16 04:02:25,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-16 04:02:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-16 04:02:25,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:25,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-16 04:02:25,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2023-02-16 04:02:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70127311] [2023-02-16 04:02:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-16 04:02:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:25,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70127311] [2023-02-16 04:02:25,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70127311] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:25,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:25,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:02:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151179558] [2023-02-16 04:02:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:25,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:02:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:25,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:02:25,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:25,930 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:26,487 INFO L93 Difference]: Finished difference Result 5488 states and 7468 transitions. [2023-02-16 04:02:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:02:26,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-16 04:02:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:26,504 INFO L225 Difference]: With dead ends: 5488 [2023-02-16 04:02:26,505 INFO L226 Difference]: Without dead ends: 5293 [2023-02-16 04:02:26,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:26,508 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 419 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:26,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 836 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:02:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2023-02-16 04:02:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 1325. [2023-02-16 04:02:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-16 04:02:26,603 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2023-02-16 04:02:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:26,603 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-16 04:02:26,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-16 04:02:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-16 04:02:26,605 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:26,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:26,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-16 04:02:26,606 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2023-02-16 04:02:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320585801] [2023-02-16 04:02:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-16 04:02:26,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:26,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320585801] [2023-02-16 04:02:26,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320585801] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:26,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:26,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 04:02:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338416601] [2023-02-16 04:02:26,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:26,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 04:02:26,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:26,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:02:26,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:02:26,814 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:27,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:27,375 INFO L93 Difference]: Finished difference Result 5470 states and 7443 transitions. [2023-02-16 04:02:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:02:27,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-16 04:02:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:27,392 INFO L225 Difference]: With dead ends: 5470 [2023-02-16 04:02:27,392 INFO L226 Difference]: Without dead ends: 5266 [2023-02-16 04:02:27,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:27,395 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 361 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:27,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 734 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:02:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2023-02-16 04:02:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 1325. [2023-02-16 04:02:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-16 04:02:27,483 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2023-02-16 04:02:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:27,483 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-16 04:02:27,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-16 04:02:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-16 04:02:27,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:27,485 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 04:02:27,486 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2023-02-16 04:02:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213875322] [2023-02-16 04:02:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-16 04:02:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213875322] [2023-02-16 04:02:27,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213875322] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:27,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726020634] [2023-02-16 04:02:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:27,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:27,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:27,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 04:02:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:27,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:02:27,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 04:02:27,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:02:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-16 04:02:27,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726020634] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:02:27,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:02:27,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2023-02-16 04:02:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650144410] [2023-02-16 04:02:27,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:02:27,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 04:02:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 04:02:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-16 04:02:27,934 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:28,853 INFO L93 Difference]: Finished difference Result 5228 states and 7442 transitions. [2023-02-16 04:02:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 04:02:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-16 04:02:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:28,861 INFO L225 Difference]: With dead ends: 5228 [2023-02-16 04:02:28,861 INFO L226 Difference]: Without dead ends: 3920 [2023-02-16 04:02:28,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2023-02-16 04:02:28,865 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 635 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:28,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 509 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 04:02:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2023-02-16 04:02:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 2957. [2023-02-16 04:02:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2956 states have (on average 1.3031123139377536) internal successors, (3852), 2956 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 3852 transitions. [2023-02-16 04:02:29,028 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 3852 transitions. Word has length 87 [2023-02-16 04:02:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:29,029 INFO L495 AbstractCegarLoop]: Abstraction has 2957 states and 3852 transitions. [2023-02-16 04:02:29,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3852 transitions. [2023-02-16 04:02:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-16 04:02:29,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:29,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:29,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:29,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:29,238 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2023-02-16 04:02:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:29,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224895700] [2023-02-16 04:02:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 04:02:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:29,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224895700] [2023-02-16 04:02:29,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224895700] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:29,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000480017] [2023-02-16 04:02:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:29,409 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:29,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 04:02:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:29,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 04:02:29,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-16 04:02:29,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000480017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:29,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:29,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-16 04:02:29,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865462957] [2023-02-16 04:02:29,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:29,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 04:02:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:29,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:02:29,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:29,593 INFO L87 Difference]: Start difference. First operand 2957 states and 3852 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:29,872 INFO L93 Difference]: Finished difference Result 6268 states and 8145 transitions. [2023-02-16 04:02:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:02:29,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-16 04:02:29,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:29,881 INFO L225 Difference]: With dead ends: 6268 [2023-02-16 04:02:29,881 INFO L226 Difference]: Without dead ends: 5776 [2023-02-16 04:02:29,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:29,898 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:29,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 184 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 04:02:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2023-02-16 04:02:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4767. [2023-02-16 04:02:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4766 states have (on average 1.3054972723457827) internal successors, (6222), 4766 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6222 transitions. [2023-02-16 04:02:30,148 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6222 transitions. Word has length 87 [2023-02-16 04:02:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:30,148 INFO L495 AbstractCegarLoop]: Abstraction has 4767 states and 6222 transitions. [2023-02-16 04:02:30,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6222 transitions. [2023-02-16 04:02:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-16 04:02:30,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:30,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:30,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:30,359 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2023-02-16 04:02:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:30,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887274860] [2023-02-16 04:02:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-16 04:02:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:30,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887274860] [2023-02-16 04:02:30,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887274860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:30,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:30,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:02:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557456622] [2023-02-16 04:02:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:30,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:02:30,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:30,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:02:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:30,547 INFO L87 Difference]: Start difference. First operand 4767 states and 6222 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:31,438 INFO L93 Difference]: Finished difference Result 10852 states and 14189 transitions. [2023-02-16 04:02:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:02:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-16 04:02:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:31,457 INFO L225 Difference]: With dead ends: 10852 [2023-02-16 04:02:31,457 INFO L226 Difference]: Without dead ends: 10596 [2023-02-16 04:02:31,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:02:31,460 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 529 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:31,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1176 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 04:02:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2023-02-16 04:02:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 4746. [2023-02-16 04:02:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4746 states, 4745 states have (on average 1.3055848261327714) internal successors, (6195), 4745 states have internal predecessors, (6195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4746 states to 4746 states and 6195 transitions. [2023-02-16 04:02:31,737 INFO L78 Accepts]: Start accepts. Automaton has 4746 states and 6195 transitions. Word has length 89 [2023-02-16 04:02:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:31,737 INFO L495 AbstractCegarLoop]: Abstraction has 4746 states and 6195 transitions. [2023-02-16 04:02:31,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4746 states and 6195 transitions. [2023-02-16 04:02:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-16 04:02:31,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:31,740 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:31,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 04:02:31,740 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:31,741 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2023-02-16 04:02:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622046032] [2023-02-16 04:02:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-16 04:02:31,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:31,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622046032] [2023-02-16 04:02:31,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622046032] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:31,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:02:31,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 04:02:31,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417384239] [2023-02-16 04:02:31,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:31,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 04:02:31,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 04:02:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 04:02:31,902 INFO L87 Difference]: Start difference. First operand 4746 states and 6195 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:32,824 INFO L93 Difference]: Finished difference Result 12133 states and 15737 transitions. [2023-02-16 04:02:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 04:02:32,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-16 04:02:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:32,846 INFO L225 Difference]: With dead ends: 12133 [2023-02-16 04:02:32,847 INFO L226 Difference]: Without dead ends: 11703 [2023-02-16 04:02:32,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:02:32,851 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 443 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:32,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1005 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 04:02:32,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2023-02-16 04:02:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 4734. [2023-02-16 04:02:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 1.3063596027889288) internal successors, (6183), 4733 states have internal predecessors, (6183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6183 transitions. [2023-02-16 04:02:33,152 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6183 transitions. Word has length 89 [2023-02-16 04:02:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:33,152 INFO L495 AbstractCegarLoop]: Abstraction has 4734 states and 6183 transitions. [2023-02-16 04:02:33,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6183 transitions. [2023-02-16 04:02:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-16 04:02:33,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:33,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 04:02:33,158 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2023-02-16 04:02:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:33,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747969510] [2023-02-16 04:02:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 04:02:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747969510] [2023-02-16 04:02:33,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747969510] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:33,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118897763] [2023-02-16 04:02:33,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:33,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:33,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:33,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 04:02:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:33,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 04:02:33,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-16 04:02:33,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 04:02:33,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118897763] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:02:33,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 04:02:33,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-02-16 04:02:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024218037] [2023-02-16 04:02:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:02:33,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 04:02:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:33,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 04:02:33,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:33,658 INFO L87 Difference]: Start difference. First operand 4734 states and 6183 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:34,216 INFO L93 Difference]: Finished difference Result 9027 states and 11722 transitions. [2023-02-16 04:02:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 04:02:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-16 04:02:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:34,230 INFO L225 Difference]: With dead ends: 9027 [2023-02-16 04:02:34,230 INFO L226 Difference]: Without dead ends: 8535 [2023-02-16 04:02:34,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-02-16 04:02:34,233 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 389 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 04:02:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2023-02-16 04:02:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 4734. [2023-02-16 04:02:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 1.3063596027889288) internal successors, (6183), 4733 states have internal predecessors, (6183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6183 transitions. [2023-02-16 04:02:34,533 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6183 transitions. Word has length 90 [2023-02-16 04:02:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:34,533 INFO L495 AbstractCegarLoop]: Abstraction has 4734 states and 6183 transitions. [2023-02-16 04:02:34,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6183 transitions. [2023-02-16 04:02:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-02-16 04:02:34,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:34,537 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:34,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:34,743 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,SelfDestructingSolverStorable25 [2023-02-16 04:02:34,743 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2023-02-16 04:02:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131843587] [2023-02-16 04:02:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-16 04:02:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:34,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131843587] [2023-02-16 04:02:34,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131843587] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:34,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351512362] [2023-02-16 04:02:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:34,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:34,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:34,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:34,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 04:02:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:35,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 04:02:35,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-16 04:02:35,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:02:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-16 04:02:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351512362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:02:35,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:02:35,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 18 [2023-02-16 04:02:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027916464] [2023-02-16 04:02:35,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:02:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 04:02:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 04:02:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:02:35,976 INFO L87 Difference]: Start difference. First operand 4734 states and 6183 transitions. Second operand has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:39,656 INFO L93 Difference]: Finished difference Result 9264 states and 11924 transitions. [2023-02-16 04:02:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-16 04:02:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-02-16 04:02:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:39,664 INFO L225 Difference]: With dead ends: 9264 [2023-02-16 04:02:39,664 INFO L226 Difference]: Without dead ends: 4400 [2023-02-16 04:02:39,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=670, Invalid=2752, Unknown=0, NotChecked=0, Total=3422 [2023-02-16 04:02:39,670 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 2082 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:39,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 1261 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-16 04:02:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2023-02-16 04:02:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3092. [2023-02-16 04:02:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3092 states, 3091 states have (on average 1.2251698479456488) internal successors, (3787), 3091 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 3787 transitions. [2023-02-16 04:02:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 3787 transitions. Word has length 93 [2023-02-16 04:02:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:39,863 INFO L495 AbstractCegarLoop]: Abstraction has 3092 states and 3787 transitions. [2023-02-16 04:02:39,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.61111111111111) internal successors, (155), 18 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 3787 transitions. [2023-02-16 04:02:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-02-16 04:02:39,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:39,866 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:39,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:40,073 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,SelfDestructingSolverStorable26 [2023-02-16 04:02:40,073 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:40,073 INFO L85 PathProgramCache]: Analyzing trace with hash -304873329, now seen corresponding path program 1 times [2023-02-16 04:02:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:40,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968285824] [2023-02-16 04:02:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:40,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-16 04:02:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:02:40,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968285824] [2023-02-16 04:02:40,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968285824] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:02:40,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660965874] [2023-02-16 04:02:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:02:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:02:40,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:02:40,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 04:02:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:02:40,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 04:02:40,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:02:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-16 04:02:41,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:02:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-16 04:02:41,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660965874] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:02:41,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:02:41,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 18 [2023-02-16 04:02:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733590815] [2023-02-16 04:02:41,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:02:41,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 04:02:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:02:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 04:02:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-02-16 04:02:41,288 INFO L87 Difference]: Start difference. First operand 3092 states and 3787 transitions. Second operand has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:02:43,711 INFO L93 Difference]: Finished difference Result 9211 states and 11215 transitions. [2023-02-16 04:02:43,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 04:02:43,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-02-16 04:02:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 04:02:43,720 INFO L225 Difference]: With dead ends: 9211 [2023-02-16 04:02:43,720 INFO L226 Difference]: Without dead ends: 5291 [2023-02-16 04:02:43,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 172 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=1188, Unknown=0, NotChecked=0, Total=1560 [2023-02-16 04:02:43,726 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1810 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 04:02:43,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 1026 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 04:02:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2023-02-16 04:02:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 4279. [2023-02-16 04:02:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4279 states, 4278 states have (on average 1.2103786816269284) internal successors, (5178), 4278 states have internal predecessors, (5178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 5178 transitions. [2023-02-16 04:02:44,045 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 5178 transitions. Word has length 93 [2023-02-16 04:02:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 04:02:44,045 INFO L495 AbstractCegarLoop]: Abstraction has 4279 states and 5178 transitions. [2023-02-16 04:02:44,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 04:02:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 5178 transitions. [2023-02-16 04:02:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-16 04:02:44,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 04:02:44,049 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:44,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 04:02:44,255 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,SelfDestructingSolverStorable27 [2023-02-16 04:02:44,255 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-16 04:02:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:02:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1251242111, now seen corresponding path program 1 times [2023-02-16 04:02:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:02:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85246734] [2023-02-16 04:02:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:02:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:02:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:02:44,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:02:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:02:44,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:02:44,325 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 04:02:44,327 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-16 04:02:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-16 04:02:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-16 04:02:44,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-16 04:02:44,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-16 04:02:44,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-16 04:02:44,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-16 04:02:44,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-16 04:02:44,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-16 04:02:44,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-16 04:02:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-16 04:02:44,338 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:02:44,342 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 04:02:44,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 04:02:44 BoogieIcfgContainer [2023-02-16 04:02:44,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 04:02:44,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:02:44,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:02:44,433 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:02:44,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:02:12" (3/4) ... [2023-02-16 04:02:44,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 04:02:44,520 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:02:44,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:02:44,521 INFO L158 Benchmark]: Toolchain (without parser) took 33053.42ms. Allocated memory was 148.9MB in the beginning and 622.9MB in the end (delta: 474.0MB). Free memory was 103.9MB in the beginning and 511.3MB in the end (delta: -407.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,521 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:02:44,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.14ms. Allocated memory is still 148.9MB. Free memory was 103.9MB in the beginning and 91.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 88.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,525 INFO L158 Benchmark]: Boogie Preprocessor took 35.11ms. Allocated memory is still 148.9MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,527 INFO L158 Benchmark]: RCFGBuilder took 620.09ms. Allocated memory is still 148.9MB. Free memory was 85.9MB in the beginning and 63.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,527 INFO L158 Benchmark]: TraceAbstraction took 32014.81ms. Allocated memory was 148.9MB in the beginning and 622.9MB in the end (delta: 474.0MB). Free memory was 62.8MB in the beginning and 519.6MB in the end (delta: -456.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,528 INFO L158 Benchmark]: Witness Printer took 87.64ms. Allocated memory is still 622.9MB. Free memory was 519.6MB in the beginning and 511.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:02:44,533 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.19ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.14ms. Allocated memory is still 148.9MB. Free memory was 103.9MB in the beginning and 91.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 88.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.11ms. Allocated memory is still 148.9MB. Free memory was 88.0MB in the beginning and 85.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.09ms. Allocated memory is still 148.9MB. Free memory was 85.9MB in the beginning and 63.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32014.81ms. Allocated memory was 148.9MB in the beginning and 622.9MB in the end (delta: 474.0MB). Free memory was 62.8MB in the beginning and 519.6MB in the end (delta: -456.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Witness Printer took 87.64ms. Allocated memory is still 622.9MB. Free memory was 519.6MB in the beginning and 511.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r1 << 8U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r2 << 16U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: 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: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9793 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9793 mSDsluCounter, 13023 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9421 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8026 IncrementalHoareTripleChecker+Invalid, 8629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 3602 mSDtfsCounter, 8026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1447 GetRequests, 1141 SyntacticMatches, 26 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4767occurred in iteration=23, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 37587 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2703 NumberOfCodeBlocks, 2703 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2920 ConstructedInterpolants, 62 QuantifiedInterpolants, 13235 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1590 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 42 InterpolantComputations, 24 PerfectInterpolantSequences, 2430/2650 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 proved your program to be incorrect! [2023-02-16 04:02:44,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)