./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 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/goblint-regression/06-symbeq_04-funloop_hard1.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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:03:25,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:03:25,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:03:25,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:03:25,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:03:25,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:03:25,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:03:25,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:03:25,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:03:25,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:03:25,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:03:25,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:03:25,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:03:25,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:03:25,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:03:25,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:03:25,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:03:25,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:03:25,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:03:25,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:03:25,113 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:03:25,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:03:25,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:03:25,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:03:25,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:03:25,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:03:25,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:03:25,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:03:25,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:03:25,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:03:25,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:03:25,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:03:25,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:03:25,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:03:25,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:03:25,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:03:25,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:03:25,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:03:25,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:03:25,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:03:25,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:03:25,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:03:25,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 14:03:25,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:03:25,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:03:25,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:03:25,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:03:25,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 14:03:25,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 14:03:25,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:03:25,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:03:25,169 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:03:25,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:03:25,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 14:03:25,170 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:03:25,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 14:03:25,171 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 14:03:25,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 14:03:25,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:03:25,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:03:25,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 14:03:25,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:03:25,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:03:25,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 14:03:25,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:25,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:03:25,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 14:03:25,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 14:03:25,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:03:25,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 14:03:25,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 14:03:25,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2022-07-14 14:03:25,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:03:25,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:03:25,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:03:25,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:03:25,416 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:03:25,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-07-14 14:03:25,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0524d477/b20bf714617d4b56b5852b63e173b655/FLAG78608ca45 [2022-07-14 14:03:25,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:03:25,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2022-07-14 14:03:25,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0524d477/b20bf714617d4b56b5852b63e173b655/FLAG78608ca45 [2022-07-14 14:03:26,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0524d477/b20bf714617d4b56b5852b63e173b655 [2022-07-14 14:03:26,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:03:26,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:03:26,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:26,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:03:26,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:03:26,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d590ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26, skipping insertion in model container [2022-07-14 14:03:26,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:03:26,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:03:26,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:26,552 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:03:26,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:26,654 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:03:26,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26 WrapperNode [2022-07-14 14:03:26,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:26,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:26,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:03:26,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:03:26,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,709 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-07-14 14:03:26,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:26,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:03:26,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:03:26,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:03:26,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:03:26,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:03:26,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:03:26,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:03:26,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:26,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 14:03:26,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 14:03:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:03:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-14 14:03:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-14 14:03:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:03:26,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:03:26,819 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-14 14:03:26,902 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:03:26,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:03:27,095 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:03:27,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:03:27,102 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 14:03:27,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:27 BoogieIcfgContainer [2022-07-14 14:03:27,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:03:27,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 14:03:27,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 14:03:27,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 14:03:27,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 02:03:26" (1/3) ... [2022-07-14 14:03:27,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e632f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:27, skipping insertion in model container [2022-07-14 14:03:27,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26" (2/3) ... [2022-07-14 14:03:27,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e632f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:27, skipping insertion in model container [2022-07-14 14:03:27,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:27" (3/3) ... [2022-07-14 14:03:27,112 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2022-07-14 14:03:27,116 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-14 14:03:27,124 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 14:03:27,124 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-07-14 14:03:27,125 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-14 14:03:27,172 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-14 14:03:27,198 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-14 14:03:27,207 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 110 transitions, 225 flow [2022-07-14 14:03:27,209 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 110 transitions, 225 flow [2022-07-14 14:03:27,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 225 flow [2022-07-14 14:03:27,248 INFO L129 PetriNetUnfolder]: 6/109 cut-off events. [2022-07-14 14:03:27,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-14 14:03:27,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 109 events. 6/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-14 14:03:27,254 INFO L116 LiptonReduction]: Number of co-enabled transitions 3072 [2022-07-14 14:03:29,317 INFO L131 LiptonReduction]: Checked pairs total: 4138 [2022-07-14 14:03:29,317 INFO L133 LiptonReduction]: Total number of compositions: 107 [2022-07-14 14:03:29,322 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 32 transitions, 69 flow [2022-07-14 14:03:29,353 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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) [2022-07-14 14:03:29,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 14:03:29,369 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45823afd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e992b2b [2022-07-14 14:03:29,369 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-14 14:03:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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) [2022-07-14 14:03:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-14 14:03:29,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-14 14:03:29,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash 13372, now seen corresponding path program 1 times [2022-07-14 14:03:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941147089] [2022-07-14 14:03:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941147089] [2022-07-14 14:03:29,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941147089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:29,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 14:03:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064682086] [2022-07-14 14:03:29,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 14:03:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 14:03:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:03:29,529 INFO L87 Difference]: Start difference. First operand has 153 states, 116 states have (on average 2.603448275862069) internal successors, (302), 152 states have internal predecessors, (302), 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 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-07-14 14:03:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:29,582 INFO L93 Difference]: Finished difference Result 152 states and 301 transitions. [2022-07-14 14:03:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 14:03:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-07-14 14:03:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:29,594 INFO L225 Difference]: With dead ends: 152 [2022-07-14 14:03:29,594 INFO L226 Difference]: Without dead ends: 151 [2022-07-14 14:03:29,595 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 [2022-07-14 14:03:29,599 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:29,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-14 14:03:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-14 14:03:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 116 states have (on average 2.5775862068965516) internal successors, (299), 150 states have internal predecessors, (299), 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) [2022-07-14 14:03:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2022-07-14 14:03:29,644 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 2 [2022-07-14 14:03:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:29,644 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 299 transitions. [2022-07-14 14:03:29,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-07-14 14:03:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 299 transitions. [2022-07-14 14:03:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-14 14:03:29,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-14 14:03:29,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 14:03:29,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash 13397, now seen corresponding path program 1 times [2022-07-14 14:03:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272147343] [2022-07-14 14:03:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:29,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272147343] [2022-07-14 14:03:29,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272147343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:29,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:29,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 14:03:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513715745] [2022-07-14 14:03:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:29,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:29,695 INFO L87 Difference]: Start difference. First operand 151 states and 299 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-07-14 14:03:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:29,740 INFO L93 Difference]: Finished difference Result 152 states and 300 transitions. [2022-07-14 14:03:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:29,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-07-14 14:03:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:29,744 INFO L225 Difference]: With dead ends: 152 [2022-07-14 14:03:29,744 INFO L226 Difference]: Without dead ends: 152 [2022-07-14 14:03:29,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:29,748 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:29,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-14 14:03:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-14 14:03:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 2.5641025641025643) internal successors, (300), 151 states have internal predecessors, (300), 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) [2022-07-14 14:03:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 300 transitions. [2022-07-14 14:03:29,758 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 300 transitions. Word has length 2 [2022-07-14 14:03:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:29,758 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 300 transitions. [2022-07-14 14:03:29,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2022-07-14 14:03:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 300 transitions. [2022-07-14 14:03:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 14:03:29,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 14:03:29,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 14:03:29,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash 415715, now seen corresponding path program 1 times [2022-07-14 14:03:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579313951] [2022-07-14 14:03:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579313951] [2022-07-14 14:03:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579313951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054703177] [2022-07-14 14:03:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:29,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:29,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 14:03:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:03:29,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:29,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:03:29,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054703177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:29,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:03:29,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-07-14 14:03:29,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398980455] [2022-07-14 14:03:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 14:03:29,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:03:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:29,926 INFO L87 Difference]: Start difference. First operand 152 states and 300 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-14 14:03:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:29,966 INFO L93 Difference]: Finished difference Result 151 states and 299 transitions. [2022-07-14 14:03:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:29,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-14 14:03:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:29,969 INFO L225 Difference]: With dead ends: 151 [2022-07-14 14:03:29,969 INFO L226 Difference]: Without dead ends: 151 [2022-07-14 14:03:29,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:29,970 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:29,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-14 14:03:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-14 14:03:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 117 states have (on average 2.5555555555555554) internal successors, (299), 150 states have internal predecessors, (299), 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) [2022-07-14 14:03:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 299 transitions. [2022-07-14 14:03:29,975 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 299 transitions. Word has length 3 [2022-07-14 14:03:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:29,975 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 299 transitions. [2022-07-14 14:03:29,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-14 14:03:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 299 transitions. [2022-07-14 14:03:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 14:03:29,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:03:29,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:30,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:30,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash -499994722, now seen corresponding path program 1 times [2022-07-14 14:03:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570573639] [2022-07-14 14:03:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570573639] [2022-07-14 14:03:30,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570573639] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:30,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085889202] [2022-07-14 14:03:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:30,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:30,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 14:03:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:03:30,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:30,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085889202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:30,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:30,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-14 14:03:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107788891] [2022-07-14 14:03:30,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:30,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 14:03:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:03:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:30,314 INFO L87 Difference]: Start difference. First operand 151 states and 299 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-14 14:03:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,403 INFO L93 Difference]: Finished difference Result 154 states and 302 transitions. [2022-07-14 14:03:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:03:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 6 [2022-07-14 14:03:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,405 INFO L225 Difference]: With dead ends: 154 [2022-07-14 14:03:30,405 INFO L226 Difference]: Without dead ends: 154 [2022-07-14 14:03:30,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:30,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-14 14:03:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-07-14 14:03:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 2.5166666666666666) internal successors, (302), 153 states have internal predecessors, (302), 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) [2022-07-14 14:03:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 302 transitions. [2022-07-14 14:03:30,410 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 302 transitions. Word has length 6 [2022-07-14 14:03:30,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,411 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 302 transitions. [2022-07-14 14:03:30,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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) [2022-07-14 14:03:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 302 transitions. [2022-07-14 14:03:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 14:03:30,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,411 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-14 14:03:30,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:30,611 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,SelfDestructingSolverStorable3 [2022-07-14 14:03:30,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:30,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1497170540, now seen corresponding path program 2 times [2022-07-14 14:03:30,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412387687] [2022-07-14 14:03:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412387687] [2022-07-14 14:03:30,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412387687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943548492] [2022-07-14 14:03:30,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:03:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:30,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:30,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 14:03:30,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 14:03:30,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:03:30,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 14:03:30,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:30,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:30,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:30,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 14:03:30,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:03:30,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943548492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:30,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:03:30,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-14 14:03:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97550412] [2022-07-14 14:03:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:30,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 14:03:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:30,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:03:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:03:30,800 INFO L87 Difference]: Start difference. First operand 154 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-07-14 14:03:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,845 INFO L93 Difference]: Finished difference Result 194 states and 387 transitions. [2022-07-14 14:03:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2022-07-14 14:03:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,847 INFO L225 Difference]: With dead ends: 194 [2022-07-14 14:03:30,847 INFO L226 Difference]: Without dead ends: 193 [2022-07-14 14:03:30,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:03:30,847 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-14 14:03:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-07-14 14:03:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 2.486111111111111) internal successors, (358), 177 states have internal predecessors, (358), 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) [2022-07-14 14:03:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 358 transitions. [2022-07-14 14:03:30,853 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 358 transitions. Word has length 9 [2022-07-14 14:03:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,853 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 358 transitions. [2022-07-14 14:03:30,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-07-14 14:03:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 358 transitions. [2022-07-14 14:03:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 14:03:30,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,854 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:30,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:31,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -832353495, now seen corresponding path program 1 times [2022-07-14 14:03:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863962028] [2022-07-14 14:03:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863962028] [2022-07-14 14:03:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863962028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966404256] [2022-07-14 14:03:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:31,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:31,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 14:03:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:03:31,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966404256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:31,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:31,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-14 14:03:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968309609] [2022-07-14 14:03:31,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 14:03:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 14:03:31,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:03:31,290 INFO L87 Difference]: Start difference. First operand 178 states and 358 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) [2022-07-14 14:03:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,370 INFO L93 Difference]: Finished difference Result 184 states and 364 transitions. [2022-07-14 14:03:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:03:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 10 [2022-07-14 14:03:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,372 INFO L225 Difference]: With dead ends: 184 [2022-07-14 14:03:31,372 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 14:03:31,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:03:31,373 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:31,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 14:03:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-07-14 14:03:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 2.4266666666666667) internal successors, (364), 183 states have internal predecessors, (364), 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) [2022-07-14 14:03:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 364 transitions. [2022-07-14 14:03:31,378 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 364 transitions. Word has length 10 [2022-07-14 14:03:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,379 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 364 transitions. [2022-07-14 14:03:31,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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) [2022-07-14 14:03:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 364 transitions. [2022-07-14 14:03:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:31,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,387 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:31,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1620250729, now seen corresponding path program 2 times [2022-07-14 14:03:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202162184] [2022-07-14 14:03:31,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202162184] [2022-07-14 14:03:31,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202162184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:31,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551418750] [2022-07-14 14:03:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:31,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:31,706 INFO L87 Difference]: Start difference. First operand 184 states and 364 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-14 14:03:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,780 INFO L93 Difference]: Finished difference Result 192 states and 376 transitions. [2022-07-14 14:03:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:31,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 16 [2022-07-14 14:03:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,782 INFO L225 Difference]: With dead ends: 192 [2022-07-14 14:03:31,782 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 14:03:31,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:31,782 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:31,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 14:03:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 185. [2022-07-14 14:03:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 2.4172185430463577) internal successors, (365), 184 states have internal predecessors, (365), 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) [2022-07-14 14:03:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 365 transitions. [2022-07-14 14:03:31,787 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 365 transitions. Word has length 16 [2022-07-14 14:03:31,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,787 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 365 transitions. [2022-07-14 14:03:31,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-14 14:03:31,787 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 365 transitions. [2022-07-14 14:03:31,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:31,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,788 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 14:03:31,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1620268424, now seen corresponding path program 1 times [2022-07-14 14:03:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627068608] [2022-07-14 14:03:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:31,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627068608] [2022-07-14 14:03:31,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627068608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:31,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:31,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499601896] [2022-07-14 14:03:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:31,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:31,869 INFO L87 Difference]: Start difference. First operand 185 states and 365 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-14 14:03:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,951 INFO L93 Difference]: Finished difference Result 187 states and 366 transitions. [2022-07-14 14:03:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:31,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 16 [2022-07-14 14:03:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,952 INFO L225 Difference]: With dead ends: 187 [2022-07-14 14:03:31,952 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 14:03:31,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:31,952 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:31,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 14:03:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-07-14 14:03:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 2.4066666666666667) internal successors, (361), 183 states have internal predecessors, (361), 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) [2022-07-14 14:03:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 361 transitions. [2022-07-14 14:03:31,956 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 361 transitions. Word has length 16 [2022-07-14 14:03:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,956 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 361 transitions. [2022-07-14 14:03:31,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2022-07-14 14:03:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 361 transitions. [2022-07-14 14:03:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:31,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,957 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 14:03:31,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:31,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2012196682, now seen corresponding path program 1 times [2022-07-14 14:03:31,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828683981] [2022-07-14 14:03:31,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828683981] [2022-07-14 14:03:32,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828683981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660933049] [2022-07-14 14:03:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:32,013 INFO L87 Difference]: Start difference. First operand 184 states and 361 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 14:03:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,069 INFO L93 Difference]: Finished difference Result 266 states and 524 transitions. [2022-07-14 14:03:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 18 [2022-07-14 14:03:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,071 INFO L225 Difference]: With dead ends: 266 [2022-07-14 14:03:32,071 INFO L226 Difference]: Without dead ends: 266 [2022-07-14 14:03:32,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:32,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-14 14:03:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 238. [2022-07-14 14:03:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 204 states have (on average 2.4313725490196076) internal successors, (496), 237 states have internal predecessors, (496), 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) [2022-07-14 14:03:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 496 transitions. [2022-07-14 14:03:32,076 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 496 transitions. Word has length 18 [2022-07-14 14:03:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,076 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 496 transitions. [2022-07-14 14:03:32,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 14:03:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 496 transitions. [2022-07-14 14:03:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:32,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,077 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 14:03:32,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1995219332, now seen corresponding path program 1 times [2022-07-14 14:03:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926590248] [2022-07-14 14:03:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926590248] [2022-07-14 14:03:32,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926590248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570212798] [2022-07-14 14:03:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:32,102 INFO L87 Difference]: Start difference. First operand 238 states and 496 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 14:03:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,141 INFO L93 Difference]: Finished difference Result 296 states and 610 transitions. [2022-07-14 14:03:32,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 18 [2022-07-14 14:03:32,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,143 INFO L225 Difference]: With dead ends: 296 [2022-07-14 14:03:32,143 INFO L226 Difference]: Without dead ends: 296 [2022-07-14 14:03:32,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:32,143 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-14 14:03:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 276. [2022-07-14 14:03:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 242 states have (on average 2.43801652892562) internal successors, (590), 275 states have internal predecessors, (590), 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) [2022-07-14 14:03:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 590 transitions. [2022-07-14 14:03:32,149 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 590 transitions. Word has length 18 [2022-07-14 14:03:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,149 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 590 transitions. [2022-07-14 14:03:32,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-07-14 14:03:32,149 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 590 transitions. [2022-07-14 14:03:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 14:03:32,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,149 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 14:03:32,150 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2047294509, now seen corresponding path program 1 times [2022-07-14 14:03:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754947971] [2022-07-14 14:03:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754947971] [2022-07-14 14:03:32,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754947971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:03:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91104549] [2022-07-14 14:03:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 14:03:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:03:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:32,223 INFO L87 Difference]: Start difference. First operand 276 states and 590 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 14:03:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,312 INFO L93 Difference]: Finished difference Result 337 states and 715 transitions. [2022-07-14 14:03:32,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:03:32,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 19 [2022-07-14 14:03:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,313 INFO L225 Difference]: With dead ends: 337 [2022-07-14 14:03:32,314 INFO L226 Difference]: Without dead ends: 337 [2022-07-14 14:03:32,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:32,314 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-14 14:03:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 308. [2022-07-14 14:03:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 274 states have (on average 2.4014598540145986) internal successors, (658), 307 states have internal predecessors, (658), 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) [2022-07-14 14:03:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 658 transitions. [2022-07-14 14:03:32,320 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 658 transitions. Word has length 19 [2022-07-14 14:03:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,320 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 658 transitions. [2022-07-14 14:03:32,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-07-14 14:03:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 658 transitions. [2022-07-14 14:03:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:32,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,320 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 14:03:32,320 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash -956786953, now seen corresponding path program 1 times [2022-07-14 14:03:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320341648] [2022-07-14 14:03:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320341648] [2022-07-14 14:03:32,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320341648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082004368] [2022-07-14 14:03:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:32,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:32,421 INFO L87 Difference]: Start difference. First operand 308 states and 658 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,569 INFO L93 Difference]: Finished difference Result 343 states and 715 transitions. [2022-07-14 14:03:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:03:32,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,571 INFO L225 Difference]: With dead ends: 343 [2022-07-14 14:03:32,571 INFO L226 Difference]: Without dead ends: 343 [2022-07-14 14:03:32,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 14:03:32,572 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-14 14:03:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 318. [2022-07-14 14:03:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 284 states have (on average 2.390845070422535) internal successors, (679), 317 states have internal predecessors, (679), 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) [2022-07-14 14:03:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 679 transitions. [2022-07-14 14:03:32,578 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 679 transitions. Word has length 20 [2022-07-14 14:03:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,587 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 679 transitions. [2022-07-14 14:03:32,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 679 transitions. [2022-07-14 14:03:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:32,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,591 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 14:03:32,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:32,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash -956753634, now seen corresponding path program 1 times [2022-07-14 14:03:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005405852] [2022-07-14 14:03:32,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005405852] [2022-07-14 14:03:32,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005405852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:32,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947543799] [2022-07-14 14:03:32,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:32,699 INFO L87 Difference]: Start difference. First operand 318 states and 679 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,872 INFO L93 Difference]: Finished difference Result 344 states and 721 transitions. [2022-07-14 14:03:32,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:03:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,873 INFO L225 Difference]: With dead ends: 344 [2022-07-14 14:03:32,873 INFO L226 Difference]: Without dead ends: 344 [2022-07-14 14:03:32,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:03:32,874 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-14 14:03:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 325. [2022-07-14 14:03:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 291 states have (on average 2.381443298969072) internal successors, (693), 324 states have internal predecessors, (693), 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) [2022-07-14 14:03:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 693 transitions. [2022-07-14 14:03:32,880 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 693 transitions. Word has length 20 [2022-07-14 14:03:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,880 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 693 transitions. [2022-07-14 14:03:32,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 693 transitions. [2022-07-14 14:03:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:32,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,881 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 14:03:32,882 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -958368114, now seen corresponding path program 2 times [2022-07-14 14:03:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964725957] [2022-07-14 14:03:32,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964725957] [2022-07-14 14:03:32,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964725957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:32,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919684626] [2022-07-14 14:03:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:32,975 INFO L87 Difference]: Start difference. First operand 325 states and 693 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,170 INFO L93 Difference]: Finished difference Result 349 states and 731 transitions. [2022-07-14 14:03:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:03:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,172 INFO L225 Difference]: With dead ends: 349 [2022-07-14 14:03:33,172 INFO L226 Difference]: Without dead ends: 349 [2022-07-14 14:03:33,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:33,172 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:33,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-14 14:03:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 324. [2022-07-14 14:03:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 290 states have (on average 2.382758620689655) internal successors, (691), 323 states have internal predecessors, (691), 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) [2022-07-14 14:03:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 691 transitions. [2022-07-14 14:03:33,178 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 691 transitions. Word has length 20 [2022-07-14 14:03:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,178 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 691 transitions. [2022-07-14 14:03:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 691 transitions. [2022-07-14 14:03:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:33,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,179 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 14:03:33,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash -958379274, now seen corresponding path program 3 times [2022-07-14 14:03:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514390173] [2022-07-14 14:03:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514390173] [2022-07-14 14:03:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514390173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:33,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896006417] [2022-07-14 14:03:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:33,264 INFO L87 Difference]: Start difference. First operand 324 states and 691 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,436 INFO L93 Difference]: Finished difference Result 340 states and 710 transitions. [2022-07-14 14:03:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:33,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,438 INFO L225 Difference]: With dead ends: 340 [2022-07-14 14:03:33,438 INFO L226 Difference]: Without dead ends: 340 [2022-07-14 14:03:33,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:33,439 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:33,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-14 14:03:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 320. [2022-07-14 14:03:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 2.3811188811188813) internal successors, (681), 319 states have internal predecessors, (681), 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) [2022-07-14 14:03:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 681 transitions. [2022-07-14 14:03:33,444 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 681 transitions. Word has length 20 [2022-07-14 14:03:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,444 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 681 transitions. [2022-07-14 14:03:33,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 681 transitions. [2022-07-14 14:03:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:33,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,445 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 14:03:33,445 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash -985684564, now seen corresponding path program 1 times [2022-07-14 14:03:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686092198] [2022-07-14 14:03:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686092198] [2022-07-14 14:03:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686092198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659041304] [2022-07-14 14:03:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:33,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:33,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 14:03:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:33,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:33,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:33,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:33,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:33,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:03:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:44,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:50,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| Int) (|t_funThread1of1ForFork0_~i~0#1| Int) (v_ArrVal_433 (Array Int Int)) (v_ArrVal_435 Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_433) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| v_ArrVal_435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) is different from false [2022-07-14 14:03:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:51,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659041304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:51,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:51,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:03:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602627737] [2022-07-14 14:03:51,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:51,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:03:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:51,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:03:51,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:03:51,006 INFO L87 Difference]: Start difference. First operand 320 states and 681 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-07-14 14:03:51,011 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| Int) (|t_funThread1of1ForFork0_~i~0#1| Int) (v_ArrVal_433 (Array Int Int)) (v_ArrVal_435 Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_433) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203| v_ArrVal_435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_202|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_203|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:03:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:51,583 INFO L93 Difference]: Finished difference Result 346 states and 721 transitions. [2022-07-14 14:03:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:03:51,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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 20 [2022-07-14 14:03:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:51,584 INFO L225 Difference]: With dead ends: 346 [2022-07-14 14:03:51,584 INFO L226 Difference]: Without dead ends: 346 [2022-07-14 14:03:51,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-14 14:03:51,585 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:51,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 268 Unchecked, 0.1s Time] [2022-07-14 14:03:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-14 14:03:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 328. [2022-07-14 14:03:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 294 states have (on average 2.380952380952381) internal successors, (700), 327 states have internal predecessors, (700), 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) [2022-07-14 14:03:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 700 transitions. [2022-07-14 14:03:51,591 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 700 transitions. Word has length 20 [2022-07-14 14:03:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:51,591 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 700 transitions. [2022-07-14 14:03:51,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-07-14 14:03:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 700 transitions. [2022-07-14 14:03:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:51,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:51,592 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:51,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:51,799 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,SelfDestructingSolverStorable15 [2022-07-14 14:03:51,800 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:51,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1277636023, now seen corresponding path program 2 times [2022-07-14 14:03:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:51,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217150677] [2022-07-14 14:03:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:51,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:51,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217150677] [2022-07-14 14:03:51,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217150677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:51,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034237174] [2022-07-14 14:03:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:51,910 INFO L87 Difference]: Start difference. First operand 328 states and 700 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:52,126 INFO L93 Difference]: Finished difference Result 363 states and 757 transitions. [2022-07-14 14:03:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:03:52,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:52,128 INFO L225 Difference]: With dead ends: 363 [2022-07-14 14:03:52,128 INFO L226 Difference]: Without dead ends: 363 [2022-07-14 14:03:52,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:52,129 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:52,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-07-14 14:03:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 327. [2022-07-14 14:03:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3822525597269624) internal successors, (698), 326 states have internal predecessors, (698), 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) [2022-07-14 14:03:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 698 transitions. [2022-07-14 14:03:52,134 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 698 transitions. Word has length 20 [2022-07-14 14:03:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:52,134 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 698 transitions. [2022-07-14 14:03:52,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 698 transitions. [2022-07-14 14:03:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:52,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:52,135 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:52,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 14:03:52,135 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1279874533, now seen corresponding path program 3 times [2022-07-14 14:03:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:52,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423833110] [2022-07-14 14:03:52,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423833110] [2022-07-14 14:03:52,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423833110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:52,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:52,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767691324] [2022-07-14 14:03:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:52,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:52,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:52,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:52,229 INFO L87 Difference]: Start difference. First operand 327 states and 698 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:52,485 INFO L93 Difference]: Finished difference Result 347 states and 722 transitions. [2022-07-14 14:03:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:52,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 20 [2022-07-14 14:03:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:52,487 INFO L225 Difference]: With dead ends: 347 [2022-07-14 14:03:52,487 INFO L226 Difference]: Without dead ends: 347 [2022-07-14 14:03:52,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:52,488 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:52,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 14:03:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-14 14:03:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 320. [2022-07-14 14:03:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 2.3846153846153846) internal successors, (682), 319 states have internal predecessors, (682), 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) [2022-07-14 14:03:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 682 transitions. [2022-07-14 14:03:52,493 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 682 transitions. Word has length 20 [2022-07-14 14:03:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:52,493 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 682 transitions. [2022-07-14 14:03:52,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-14 14:03:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 682 transitions. [2022-07-14 14:03:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:52,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:52,494 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:52,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 14:03:52,494 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1850339221, now seen corresponding path program 1 times [2022-07-14 14:03:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:52,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428373746] [2022-07-14 14:03:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:52,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428373746] [2022-07-14 14:03:52,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428373746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:52,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062697752] [2022-07-14 14:03:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:52,604 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 14:03:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:52,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:52,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:52,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:52,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:52,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:52,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:04:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:07,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:14,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_567 Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_565) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| v_ArrVal_567) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|)))) is different from false [2022-07-14 14:04:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:14,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062697752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:14,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:14,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577037994] [2022-07-14 14:04:14,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:14,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:14,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:04:14,393 INFO L87 Difference]: Start difference. First operand 320 states and 682 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-07-14 14:04:14,396 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_567 Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_565) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| v_ArrVal_567) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_134|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|)))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:04:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:15,486 INFO L93 Difference]: Finished difference Result 346 states and 729 transitions. [2022-07-14 14:04:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:04:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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 20 [2022-07-14 14:04:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:15,488 INFO L225 Difference]: With dead ends: 346 [2022-07-14 14:04:15,488 INFO L226 Difference]: Without dead ends: 346 [2022-07-14 14:04:15,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=103, Invalid=265, Unknown=20, NotChecked=74, Total=462 [2022-07-14 14:04:15,488 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:15,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 373 Unchecked, 0.1s Time] [2022-07-14 14:04:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-14 14:04:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 327. [2022-07-14 14:04:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3890784982935154) internal successors, (700), 326 states have internal predecessors, (700), 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) [2022-07-14 14:04:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 700 transitions. [2022-07-14 14:04:15,494 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 700 transitions. Word has length 20 [2022-07-14 14:04:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:15,494 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 700 transitions. [2022-07-14 14:04:15,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 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) [2022-07-14 14:04:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 700 transitions. [2022-07-14 14:04:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:04:15,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:15,494 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:15,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-14 14:04:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:15,710 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:04:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -491450081, now seen corresponding path program 1 times [2022-07-14 14:04:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:15,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876450285] [2022-07-14 14:04:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876450285] [2022-07-14 14:04:15,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876450285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:15,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860813351] [2022-07-14 14:04:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:15,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:15,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 14:04:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:15,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:15,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:15,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:04:15,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:15,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:16,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:04:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:27,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:34,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207| Int) (v_ArrVal_635 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| Int) (|v_t_funThread1of1ForFork0_~i~0#1_135| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_637 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_135|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_635) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| v_ArrVal_637) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_135| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208|)))) is different from false [2022-07-14 14:04:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:34,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860813351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:34,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:34,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594226985] [2022-07-14 14:04:34,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:34,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:34,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:34,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:04:34,163 INFO L87 Difference]: Start difference. First operand 327 states and 700 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:04:34,168 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207| Int) (v_ArrVal_635 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| Int) (|v_t_funThread1of1ForFork0_~i~0#1_135| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_637 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_135|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_635) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208| v_ArrVal_637) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_207|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_135| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_208|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:04:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:35,463 INFO L93 Difference]: Finished difference Result 350 states and 734 transitions. [2022-07-14 14:04:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:04:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 21 [2022-07-14 14:04:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:35,465 INFO L225 Difference]: With dead ends: 350 [2022-07-14 14:04:35,465 INFO L226 Difference]: Without dead ends: 350 [2022-07-14 14:04:35,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=101, Invalid=267, Unknown=20, NotChecked=74, Total=462 [2022-07-14 14:04:35,466 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:35,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 280 Unchecked, 0.1s Time] [2022-07-14 14:04:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-14 14:04:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 330. [2022-07-14 14:04:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 296 states have (on average 2.391891891891892) internal successors, (708), 329 states have internal predecessors, (708), 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) [2022-07-14 14:04:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 708 transitions. [2022-07-14 14:04:35,471 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 708 transitions. Word has length 21 [2022-07-14 14:04:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:35,471 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 708 transitions. [2022-07-14 14:04:35,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:04:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 708 transitions. [2022-07-14 14:04:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:04:35,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:35,471 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:35,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:04:35,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:35,687 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:04:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -491461241, now seen corresponding path program 2 times [2022-07-14 14:04:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:35,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064319647] [2022-07-14 14:04:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:35,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064319647] [2022-07-14 14:04:35,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064319647] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:35,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216142327] [2022-07-14 14:04:35,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:04:35,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:35,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:35,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:35,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 14:04:35,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:04:35,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:04:35,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:35,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:35,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:04:35,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:35,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:35,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:04:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:49,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:56,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_139| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_139|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_139| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) is different from false [2022-07-14 14:04:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:56,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216142327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:56,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:56,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193984009] [2022-07-14 14:04:56,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:56,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:56,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:04:56,397 INFO L87 Difference]: Start difference. First operand 330 states and 708 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:04:56,400 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_139| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_705) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212| v_ArrVal_706) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_139|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_211|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_139| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_212|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|))))) is different from false [2022-07-14 14:04:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:56,993 INFO L93 Difference]: Finished difference Result 338 states and 724 transitions. [2022-07-14 14:04:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:04:56,993 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 21 [2022-07-14 14:04:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:56,995 INFO L225 Difference]: With dead ends: 338 [2022-07-14 14:04:56,995 INFO L226 Difference]: Without dead ends: 338 [2022-07-14 14:04:56,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-14 14:04:56,995 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:56,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 192 Unchecked, 0.0s Time] [2022-07-14 14:04:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-14 14:04:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2022-07-14 14:04:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 292 states have (on average 2.3904109589041096) internal successors, (698), 325 states have internal predecessors, (698), 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) [2022-07-14 14:04:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 698 transitions. [2022-07-14 14:04:57,001 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 698 transitions. Word has length 21 [2022-07-14 14:04:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:57,001 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 698 transitions. [2022-07-14 14:04:57,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:04:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 698 transitions. [2022-07-14 14:04:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:04:57,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:57,002 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:57,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-14 14:04:57,218 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,SelfDestructingSolverStorable20 [2022-07-14 14:04:57,218 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:04:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1525941050, now seen corresponding path program 1 times [2022-07-14 14:04:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:57,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020502870] [2022-07-14 14:04:57,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:57,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020502870] [2022-07-14 14:04:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020502870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590741344] [2022-07-14 14:04:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:57,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:57,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:57,312 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:57,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 14:04:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:57,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:57,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:57,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:04:57,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:57,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:57,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:05:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:10,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:17,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_121| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_121|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| (* |v_ULTIMATE.start_main_~i~2#1_121| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_775) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| v_ArrVal_777) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)))) is different from false [2022-07-14 14:05:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:17,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590741344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:17,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:17,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328832866] [2022-07-14 14:05:17,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:17,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:17,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:17,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:17,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:05:17,369 INFO L87 Difference]: Start difference. First operand 326 states and 698 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:05:17,374 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_121| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_121|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| (* |v_ULTIMATE.start_main_~i~2#1_121| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_775) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| v_ArrVal_777) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_137|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|))))) is different from false [2022-07-14 14:05:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:18,495 INFO L93 Difference]: Finished difference Result 353 states and 746 transitions. [2022-07-14 14:05:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:05:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 21 [2022-07-14 14:05:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:18,496 INFO L225 Difference]: With dead ends: 353 [2022-07-14 14:05:18,496 INFO L226 Difference]: Without dead ends: 353 [2022-07-14 14:05:18,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=103, Invalid=264, Unknown=21, NotChecked=74, Total=462 [2022-07-14 14:05:18,497 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:05:18,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 221 Unchecked, 0.1s Time] [2022-07-14 14:05:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-14 14:05:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2022-07-14 14:05:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 295 states have (on average 2.389830508474576) internal successors, (705), 328 states have internal predecessors, (705), 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) [2022-07-14 14:05:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 705 transitions. [2022-07-14 14:05:18,503 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 705 transitions. Word has length 21 [2022-07-14 14:05:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:18,503 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 705 transitions. [2022-07-14 14:05:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:05:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 705 transitions. [2022-07-14 14:05:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:05:18,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:18,504 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:18,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 14:05:18,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:18,718 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:05:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1525981040, now seen corresponding path program 2 times [2022-07-14 14:05:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:18,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127433653] [2022-07-14 14:05:18,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:18,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127433653] [2022-07-14 14:05:18,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127433653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:18,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553485254] [2022-07-14 14:05:18,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:05:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:18,836 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:05:18,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 14:05:18,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:05:18,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:05:18,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:18,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:18,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:05:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:18,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:05:19,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:05:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:28,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:35,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140| Int) (v_ArrVal_846 Int) (|v_ULTIMATE.start_main_~i~2#1_125| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) (+ (* |v_ULTIMATE.start_main_~i~2#1_125| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_845) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| v_ArrVal_846) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_125|)))) is different from false [2022-07-14 14:05:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:35,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553485254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:35,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:35,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054081953] [2022-07-14 14:05:35,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:35,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:05:35,322 INFO L87 Difference]: Start difference. First operand 329 states and 705 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:05:35,326 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| Int) (v_ArrVal_845 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140| Int) (v_ArrVal_846 Int) (|v_ULTIMATE.start_main_~i~2#1_125| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) (+ (* |v_ULTIMATE.start_main_~i~2#1_125| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_45|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_845) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| v_ArrVal_846) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_140|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_125|))))) is different from false [2022-07-14 14:05:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:35,987 INFO L93 Difference]: Finished difference Result 347 states and 732 transitions. [2022-07-14 14:05:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:05:35,988 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 21 [2022-07-14 14:05:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:35,989 INFO L225 Difference]: With dead ends: 347 [2022-07-14 14:05:35,989 INFO L226 Difference]: Without dead ends: 347 [2022-07-14 14:05:35,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-14 14:05:35,990 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:05:35,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-07-14 14:05:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-14 14:05:35,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 326. [2022-07-14 14:05:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 292 states have (on average 2.3904109589041096) internal successors, (698), 325 states have internal predecessors, (698), 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) [2022-07-14 14:05:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 698 transitions. [2022-07-14 14:05:35,995 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 698 transitions. Word has length 21 [2022-07-14 14:05:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:35,995 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 698 transitions. [2022-07-14 14:05:35,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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) [2022-07-14 14:05:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 698 transitions. [2022-07-14 14:05:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:05:35,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:35,996 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:36,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 14:05:36,212 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,SelfDestructingSolverStorable22 [2022-07-14 14:05:36,213 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:05:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1879380633, now seen corresponding path program 1 times [2022-07-14 14:05:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:36,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407822848] [2022-07-14 14:05:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407822848] [2022-07-14 14:05:36,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407822848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090413100] [2022-07-14 14:05:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:36,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:36,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:36,286 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:05:36,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 14:05:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:36,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:36,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:36,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:05:36,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:36,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:05:36,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:05:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:49,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:56,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_919) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) is different from false [2022-07-14 14:05:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090413100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:56,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:56,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473577583] [2022-07-14 14:05:56,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:05:56,825 INFO L87 Difference]: Start difference. First operand 326 states and 698 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:05:56,828 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_919 (Array Int Int)) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_919) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-14 14:06:06,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (<= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483646) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (v_ArrVal_921 Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |c_~#cache~0.offset|)) (<= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_921)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-14 14:06:06,788 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| Int) (v_ArrVal_921 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218|)) (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_218| v_ArrVal_921) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| Int) (|v_t_funThread1of1ForFork0_~i~0#1_147| Int) (v_ArrVal_921 Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_147|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_147| 28) |c_~#cache~0.offset|)) (<= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_921)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_217|) 2147483646)))) is different from false [2022-07-14 14:06:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:11,584 INFO L93 Difference]: Finished difference Result 349 states and 748 transitions. [2022-07-14 14:06:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 14:06:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 22 [2022-07-14 14:06:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:11,586 INFO L225 Difference]: With dead ends: 349 [2022-07-14 14:06:11,586 INFO L226 Difference]: Without dead ends: 349 [2022-07-14 14:06:11,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=130, Invalid=358, Unknown=34, NotChecked=180, Total=702 [2022-07-14 14:06:11,587 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:11,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 211 Unchecked, 0.0s Time] [2022-07-14 14:06:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-14 14:06:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 328. [2022-07-14 14:06:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 294 states have (on average 2.3945578231292517) internal successors, (704), 327 states have internal predecessors, (704), 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) [2022-07-14 14:06:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 704 transitions. [2022-07-14 14:06:11,592 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 704 transitions. Word has length 22 [2022-07-14 14:06:11,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:11,592 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 704 transitions. [2022-07-14 14:06:11,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:06:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 704 transitions. [2022-07-14 14:06:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:11,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:11,593 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:11,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:11,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 14:06:11,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1944917779, now seen corresponding path program 2 times [2022-07-14 14:06:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:11,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155436591] [2022-07-14 14:06:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155436591] [2022-07-14 14:06:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155436591] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384512887] [2022-07-14 14:06:11,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:06:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:11,899 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:06:11,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 14:06:12,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:06:12,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:06:12,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:06:12,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:12,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:06:12,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:12,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:06:12,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:06:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:21,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:28,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_151| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| Int) (v_ArrVal_993 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_151|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| v_ArrVal_994) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_151| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) is different from false [2022-07-14 14:06:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384512887] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:28,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:28,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:06:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465127831] [2022-07-14 14:06:28,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:06:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:06:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:06:28,455 INFO L87 Difference]: Start difference. First operand 328 states and 704 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:06:28,459 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_994 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_151| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| Int) (v_ArrVal_993 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_151|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222| v_ArrVal_994) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_221|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_151| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_222|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:06:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:29,032 INFO L93 Difference]: Finished difference Result 347 states and 727 transitions. [2022-07-14 14:06:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:06:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 22 [2022-07-14 14:06:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:29,034 INFO L225 Difference]: With dead ends: 347 [2022-07-14 14:06:29,034 INFO L226 Difference]: Without dead ends: 347 [2022-07-14 14:06:29,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-14 14:06:29,035 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:29,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 336 Unchecked, 0.1s Time] [2022-07-14 14:06:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-14 14:06:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 327. [2022-07-14 14:06:29,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 293 states have (on average 2.3959044368600684) internal successors, (702), 326 states have internal predecessors, (702), 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) [2022-07-14 14:06:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 702 transitions. [2022-07-14 14:06:29,040 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 702 transitions. Word has length 22 [2022-07-14 14:06:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:29,041 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 702 transitions. [2022-07-14 14:06:29,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:06:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 702 transitions. [2022-07-14 14:06:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:29,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:29,041 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:29,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 14:06:29,260 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1944887609, now seen corresponding path program 1 times [2022-07-14 14:06:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654022526] [2022-07-14 14:06:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 14:06:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:29,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654022526] [2022-07-14 14:06:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654022526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:06:29,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:06:29,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:06:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528677832] [2022-07-14 14:06:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:06:29,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:06:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:06:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:29,285 INFO L87 Difference]: Start difference. First operand 327 states and 702 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:06:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:29,327 INFO L93 Difference]: Finished difference Result 308 states and 662 transitions. [2022-07-14 14:06:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:06:29,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 22 [2022-07-14 14:06:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:29,329 INFO L225 Difference]: With dead ends: 308 [2022-07-14 14:06:29,329 INFO L226 Difference]: Without dead ends: 308 [2022-07-14 14:06:29,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:29,329 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:29,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:06:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-14 14:06:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-07-14 14:06:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 281 states have (on average 2.3558718861209966) internal successors, (662), 307 states have internal predecessors, (662), 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) [2022-07-14 14:06:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 662 transitions. [2022-07-14 14:06:29,338 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 662 transitions. Word has length 22 [2022-07-14 14:06:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:29,338 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 662 transitions. [2022-07-14 14:06:29,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:06:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 662 transitions. [2022-07-14 14:06:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:29,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:29,339 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:29,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 14:06:29,340 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:29,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1944887634, now seen corresponding path program 1 times [2022-07-14 14:06:29,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:29,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131804506] [2022-07-14 14:06:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:29,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131804506] [2022-07-14 14:06:29,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131804506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:06:29,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:06:29,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:06:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028538377] [2022-07-14 14:06:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:06:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:06:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:06:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:29,362 INFO L87 Difference]: Start difference. First operand 308 states and 662 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:06:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:29,403 INFO L93 Difference]: Finished difference Result 289 states and 622 transitions. [2022-07-14 14:06:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:06:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 22 [2022-07-14 14:06:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:29,404 INFO L225 Difference]: With dead ends: 289 [2022-07-14 14:06:29,404 INFO L226 Difference]: Without dead ends: 289 [2022-07-14 14:06:29,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:29,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:29,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:06:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-14 14:06:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 243. [2022-07-14 14:06:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 223 states have (on average 2.304932735426009) internal successors, (514), 242 states have internal predecessors, (514), 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) [2022-07-14 14:06:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 514 transitions. [2022-07-14 14:06:29,409 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 514 transitions. Word has length 22 [2022-07-14 14:06:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:29,409 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 514 transitions. [2022-07-14 14:06:29,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:06:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 514 transitions. [2022-07-14 14:06:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:29,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:29,410 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:29,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 14:06:29,410 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1944583909, now seen corresponding path program 3 times [2022-07-14 14:06:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:29,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152528252] [2022-07-14 14:06:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152528252] [2022-07-14 14:06:29,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152528252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:29,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142439171] [2022-07-14 14:06:29,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 14:06:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:29,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:06:29,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 14:06:29,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 14:06:29,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:06:29,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 14:06:29,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:29,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:06:29,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:29,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:06:29,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:06:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:34,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:57,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_t_funThread1of1ForFork0_~i~0#1_155| Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| (* |v_t_funThread1of1ForFork0_~i~0#1_155| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225|) 2147483646) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_155|)))) is different from false [2022-07-14 14:06:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142439171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:57,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:57,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-07-14 14:06:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419878440] [2022-07-14 14:06:57,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:57,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 14:06:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:57,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 14:06:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=293, Unknown=24, NotChecked=38, Total=462 [2022-07-14 14:06:57,513 INFO L87 Difference]: Start difference. First operand 243 states and 514 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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) [2022-07-14 14:06:57,519 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (|v_t_funThread1of1ForFork0_~i~0#1_155| Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| (* |v_t_funThread1of1ForFork0_~i~0#1_155| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_226| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_225|) 2147483646) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_155|)))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:06:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:58,110 INFO L93 Difference]: Finished difference Result 246 states and 520 transitions. [2022-07-14 14:06:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:06:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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 22 [2022-07-14 14:06:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:58,111 INFO L225 Difference]: With dead ends: 246 [2022-07-14 14:06:58,111 INFO L226 Difference]: Without dead ends: 246 [2022-07-14 14:06:58,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=116, Invalid=329, Unknown=25, NotChecked=82, Total=552 [2022-07-14 14:06:58,112 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:58,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 230 Unchecked, 0.1s Time] [2022-07-14 14:06:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-14 14:06:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2022-07-14 14:06:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 219 states have (on average 2.3013698630136985) internal successors, (504), 238 states have internal predecessors, (504), 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) [2022-07-14 14:06:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 504 transitions. [2022-07-14 14:06:58,116 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 504 transitions. Word has length 22 [2022-07-14 14:06:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:58,116 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 504 transitions. [2022-07-14 14:06:58,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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) [2022-07-14 14:06:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 504 transitions. [2022-07-14 14:06:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:58,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:58,117 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:58,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 14:06:58,328 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:58,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1598488545, now seen corresponding path program 1 times [2022-07-14 14:06:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:58,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578881573] [2022-07-14 14:06:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:58,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578881573] [2022-07-14 14:06:58,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578881573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:58,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868570612] [2022-07-14 14:06:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:58,424 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:06:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 14:06:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:58,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:06:58,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:58,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:06:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:58,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:06:58,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:07:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:11,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:18,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1217 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_135| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) (+ (* |v_ULTIMATE.start_main_~i~2#1_135| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1215) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| v_ArrVal_1217) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) 2147483646))) is different from false [2022-07-14 14:07:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:18,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868570612] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:18,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:18,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:07:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687746486] [2022-07-14 14:07:18,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:18,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:07:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:18,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:07:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:07:18,880 INFO L87 Difference]: Start difference. First operand 239 states and 504 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:07:18,885 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1217 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| Int) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_135| Int)) (or (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) (+ (* |v_ULTIMATE.start_main_~i~2#1_135| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_135|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1215) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_147| v_ArrVal_1217) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_146|) 2147483646)))) is different from false [2022-07-14 14:07:27,600 WARN L233 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 14:07:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:32,609 INFO L93 Difference]: Finished difference Result 277 states and 579 transitions. [2022-07-14 14:07:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 14:07:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 22 [2022-07-14 14:07:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:32,610 INFO L225 Difference]: With dead ends: 277 [2022-07-14 14:07:32,610 INFO L226 Difference]: Without dead ends: 277 [2022-07-14 14:07:32,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=134, Invalid=356, Unknown=24, NotChecked=86, Total=600 [2022-07-14 14:07:32,611 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:32,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 207 Unchecked, 0.1s Time] [2022-07-14 14:07:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-07-14 14:07:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 240. [2022-07-14 14:07:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 220 states have (on average 2.3) internal successors, (506), 239 states have internal predecessors, (506), 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) [2022-07-14 14:07:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 506 transitions. [2022-07-14 14:07:32,615 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 506 transitions. Word has length 22 [2022-07-14 14:07:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:32,615 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 506 transitions. [2022-07-14 14:07:32,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:07:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 506 transitions. [2022-07-14 14:07:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:32,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:32,616 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:32,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 14:07:32,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:32,828 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:07:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -59531411, now seen corresponding path program 2 times [2022-07-14 14:07:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:32,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691902055] [2022-07-14 14:07:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:32,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691902055] [2022-07-14 14:07:32,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691902055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642463026] [2022-07-14 14:07:32,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:07:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:32,917 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:07:32,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 14:07:33,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:07:33,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:07:33,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:07:33,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:33,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:07:33,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:33,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:07:33,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:07:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:45,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:52,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_139| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1290 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_139|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| (* |v_ULTIMATE.start_main_~i~2#1_139| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1289) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1290) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) 2147483646))) is different from false [2022-07-14 14:07:52,798 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:52,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642463026] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:52,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:52,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:07:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065115547] [2022-07-14 14:07:52,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:52,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:07:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:07:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:07:52,800 INFO L87 Difference]: Start difference. First operand 240 states and 506 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:07:52,807 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~2#1_139| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (v_ArrVal_1290 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_139|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| (* |v_ULTIMATE.start_main_~i~2#1_139| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1289) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1290) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_149|) 2147483646))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:08:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:08:01,036 INFO L93 Difference]: Finished difference Result 271 states and 564 transitions. [2022-07-14 14:08:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 14:08:01,036 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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 22 [2022-07-14 14:08:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:08:01,037 INFO L225 Difference]: With dead ends: 271 [2022-07-14 14:08:01,037 INFO L226 Difference]: Without dead ends: 271 [2022-07-14 14:08:01,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=131, Invalid=363, Unknown=20, NotChecked=86, Total=600 [2022-07-14 14:08:01,038 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:08:01,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 336 Unchecked, 0.1s Time] [2022-07-14 14:08:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-14 14:08:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2022-07-14 14:08:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 215 states have (on average 2.302325581395349) internal successors, (495), 234 states have internal predecessors, (495), 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) [2022-07-14 14:08:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 495 transitions. [2022-07-14 14:08:01,042 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 495 transitions. Word has length 22 [2022-07-14 14:08:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:08:01,042 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 495 transitions. [2022-07-14 14:08:01,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 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) [2022-07-14 14:08:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 495 transitions. [2022-07-14 14:08:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:08:01,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:08:01,043 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:08:01,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-14 14:08:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:08:01,254 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:08:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:08:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -59577185, now seen corresponding path program 1 times [2022-07-14 14:08:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:08:01,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482749702] [2022-07-14 14:08:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:08:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:08:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:08:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:08:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:08:01,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482749702] [2022-07-14 14:08:01,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482749702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:08:01,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:08:01,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:08:01,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83301644] [2022-07-14 14:08:01,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:08:01,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:08:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:08:01,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:08:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:08:01,289 INFO L87 Difference]: Start difference. First operand 235 states and 495 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:08:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:08:01,322 INFO L93 Difference]: Finished difference Result 226 states and 476 transitions. [2022-07-14 14:08:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:08:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 22 [2022-07-14 14:08:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:08:01,324 INFO L225 Difference]: With dead ends: 226 [2022-07-14 14:08:01,324 INFO L226 Difference]: Without dead ends: 226 [2022-07-14 14:08:01,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:08:01,326 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:08:01,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:08:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-14 14:08:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-07-14 14:08:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 2.277511961722488) internal successors, (476), 225 states have internal predecessors, (476), 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) [2022-07-14 14:08:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 476 transitions. [2022-07-14 14:08:01,331 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 476 transitions. Word has length 22 [2022-07-14 14:08:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:08:01,332 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 476 transitions. [2022-07-14 14:08:01,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:08:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 476 transitions. [2022-07-14 14:08:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:08:01,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:08:01,333 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:08:01,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 14:08:01,333 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:08:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:08:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash -59577184, now seen corresponding path program 1 times [2022-07-14 14:08:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:08:01,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192492965] [2022-07-14 14:08:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:08:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:08:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:08:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 14:08:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:08:01,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192492965] [2022-07-14 14:08:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192492965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:08:01,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:08:01,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:08:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776473784] [2022-07-14 14:08:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:08:01,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:08:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:08:01,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:08:01,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:08:01,372 INFO L87 Difference]: Start difference. First operand 226 states and 476 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:08:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:08:01,414 INFO L93 Difference]: Finished difference Result 217 states and 457 transitions. [2022-07-14 14:08:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:08:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 22 [2022-07-14 14:08:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:08:01,416 INFO L225 Difference]: With dead ends: 217 [2022-07-14 14:08:01,416 INFO L226 Difference]: Without dead ends: 217 [2022-07-14 14:08:01,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:08:01,417 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:08:01,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:08:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-14 14:08:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2022-07-14 14:08:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 179 states have (on average 2.2458100558659218) internal successors, (402), 192 states have internal predecessors, (402), 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) [2022-07-14 14:08:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 402 transitions. [2022-07-14 14:08:01,422 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 402 transitions. Word has length 22 [2022-07-14 14:08:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:08:01,422 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 402 transitions. [2022-07-14 14:08:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-07-14 14:08:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 402 transitions. [2022-07-14 14:08:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:08:01,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:08:01,423 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:08:01,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 14:08:01,423 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:08:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:08:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash -60783191, now seen corresponding path program 3 times [2022-07-14 14:08:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:08:01,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782419346] [2022-07-14 14:08:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:08:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:08:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:08:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:08:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:08:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782419346] [2022-07-14 14:08:01,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782419346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:08:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320395201] [2022-07-14 14:08:01,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 14:08:01,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:08:01,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:08:01,532 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:08:01,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 14:08:01,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 14:08:01,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:08:01,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:08:01,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:08:01,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:08:01,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:08:01,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:08:01,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13