./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c 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_03-funloop_simple.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 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:22:17,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:22:17,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:22:17,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:22:17,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:22:17,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:22:17,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:22:17,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:22:17,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:22:17,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:22:17,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:22:17,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:22:17,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:22:17,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:22:17,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:22:17,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:22:17,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:22:17,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:22:17,264 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:22:17,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:22:17,269 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:22:17,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:22:17,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:22:17,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:22:17,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:22:17,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:22:17,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:22:17,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:22:17,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:22:17,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:22:17,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:22:17,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:22:17,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:22:17,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:22:17,282 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:22:17,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:22:17,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:22:17,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:22:17,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:22:17,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:22:17,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:22:17,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:22:17,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:22:17,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:22:17,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:22:17,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:22:17,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:22:17,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:22:17,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:22:17,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:22:17,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:22:17,310 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:22:17,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:22:17,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:22:17,311 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:22:17,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:22:17,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:22:17,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:22:17,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:22:17,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:22:17,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:22:17,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:22:17,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:22:17,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:17,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:22:17,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:22:17,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:22:17,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:22:17,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:22:17,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:22:17,315 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 -> 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 [2022-07-13 02:22:17,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:22:17,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:22:17,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:22:17,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:22:17,512 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:22:17,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-07-13 02:22:17,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d304c248e/5a30d7a3ac044bcca7271fa657863b22/FLAG42a81f113 [2022-07-13 02:22:18,103 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:22:18,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-07-13 02:22:18,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d304c248e/5a30d7a3ac044bcca7271fa657863b22/FLAG42a81f113 [2022-07-13 02:22:18,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d304c248e/5a30d7a3ac044bcca7271fa657863b22 [2022-07-13 02:22:18,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:22:18,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:22:18,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:18,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:22:18,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:22:18,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:18" (1/1) ... [2022-07-13 02:22:18,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f07865c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:18, skipping insertion in model container [2022-07-13 02:22:18,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:22:18" (1/1) ... [2022-07-13 02:22:18,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:22:18,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:22:18,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:18,978 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:22:19,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:22:19,035 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:22:19,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19 WrapperNode [2022-07-13 02:22:19,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:22:19,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:19,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:22:19,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:22:19,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,074 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-07-13 02:22:19,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:22:19,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:22:19,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:22:19,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:22:19,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:22:19,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:22:19,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:22:19,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:22:19,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (1/1) ... [2022-07-13 02:22:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:22:19,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:19,133 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-13 02:22:19,135 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-13 02:22:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 02:22:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 02:22:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:22:19,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:22:19,161 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 02:22:19,238 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:22:19,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:22:19,400 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:22:19,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:22:19,406 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 02:22:19,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:19 BoogieIcfgContainer [2022-07-13 02:22:19,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:22:19,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:22:19,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:22:19,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:22:19,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:22:18" (1/3) ... [2022-07-13 02:22:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3434c998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:19, skipping insertion in model container [2022-07-13 02:22:19,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:22:19" (2/3) ... [2022-07-13 02:22:19,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3434c998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:22:19, skipping insertion in model container [2022-07-13 02:22:19,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:22:19" (3/3) ... [2022-07-13 02:22:19,413 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-07-13 02:22:19,417 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 02:22:19,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:22:19,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-07-13 02:22:19,424 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 02:22:19,469 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-13 02:22:19,503 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-13 02:22:19,514 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 107 transitions, 219 flow [2022-07-13 02:22:19,516 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 107 transitions, 219 flow [2022-07-13 02:22:19,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 219 flow [2022-07-13 02:22:19,560 INFO L129 PetriNetUnfolder]: 6/106 cut-off events. [2022-07-13 02:22:19,561 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 02:22:19,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 6/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-07-13 02:22:19,569 INFO L116 LiptonReduction]: Number of co-enabled transitions 2880 [2022-07-13 02:22:21,539 INFO L131 LiptonReduction]: Checked pairs total: 3768 [2022-07-13 02:22:21,540 INFO L133 LiptonReduction]: Total number of compositions: 109 [2022-07-13 02:22:21,550 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions, 65 flow [2022-07-13 02:22:21,570 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 134 states, 97 states have (on average 2.7216494845360826) internal successors, (264), 133 states have internal predecessors, (264), 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-13 02:22:21,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:22:21,592 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@af22147, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@760611be [2022-07-13 02:22:21,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-13 02:22:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 97 states have (on average 2.7216494845360826) internal successors, (264), 133 states have internal predecessors, (264), 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-13 02:22:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-13 02:22:21,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-13 02:22:21,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:21,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 13261, now seen corresponding path program 1 times [2022-07-13 02:22:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701302876] [2022-07-13 02:22:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,791 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-13 02:22:21,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701302876] [2022-07-13 02:22:21,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701302876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:21,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-13 02:22:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158506812] [2022-07-13 02:22:21,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:21,824 INFO L87 Difference]: Start difference. First operand has 134 states, 97 states have (on average 2.7216494845360826) internal successors, (264), 133 states have internal predecessors, (264), 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 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-13 02:22:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:21,897 INFO L93 Difference]: Finished difference Result 132 states and 262 transitions. [2022-07-13 02:22:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:21,899 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-13 02:22:21,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:21,906 INFO L225 Difference]: With dead ends: 132 [2022-07-13 02:22:21,906 INFO L226 Difference]: Without dead ends: 131 [2022-07-13 02:22:21,907 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-13 02:22:21,909 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:21,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-13 02:22:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-13 02:22:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 2.6804123711340204) internal successors, (260), 130 states have internal predecessors, (260), 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-13 02:22:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 260 transitions. [2022-07-13 02:22:21,936 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 260 transitions. Word has length 2 [2022-07-13 02:22:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:21,936 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 260 transitions. [2022-07-13 02:22:21,936 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-13 02:22:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 260 transitions. [2022-07-13 02:22:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 02:22:21,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:21,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 02:22:21,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:22:21,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:21,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 395156038, now seen corresponding path program 1 times [2022-07-13 02:22:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:21,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047078951] [2022-07-13 02:22:21,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:21,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:21,960 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-13 02:22:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:21,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047078951] [2022-07-13 02:22:21,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047078951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:21,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:21,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287495649] [2022-07-13 02:22:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:21,963 INFO L87 Difference]: Start difference. First operand 131 states and 260 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-13 02:22:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,019 INFO L93 Difference]: Finished difference Result 132 states and 261 transitions. [2022-07-13 02:22:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-07-13 02:22:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,021 INFO L225 Difference]: With dead ends: 132 [2022-07-13 02:22:22,021 INFO L226 Difference]: Without dead ends: 132 [2022-07-13 02:22:22,022 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-13 02:22:22,023 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-13 02:22:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-13 02:22:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 2.663265306122449) internal successors, (261), 131 states have internal predecessors, (261), 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-13 02:22:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 261 transitions. [2022-07-13 02:22:22,030 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 261 transitions. Word has length 5 [2022-07-13 02:22:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,030 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 261 transitions. [2022-07-13 02:22:22,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-13 02:22:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 261 transitions. [2022-07-13 02:22:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 02:22:22,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:22:22,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash -616036353, now seen corresponding path program 1 times [2022-07-13 02:22:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354762179] [2022-07-13 02:22:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,083 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-13 02:22:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354762179] [2022-07-13 02:22:22,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354762179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835114798] [2022-07-13 02:22:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,086 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-13 02:22:22,087 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-13 02:22:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 02:22:22,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 02:22:22,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:22:22,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835114798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:22,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:22:22,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-07-13 02:22:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125963439] [2022-07-13 02:22:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:22,144 INFO L87 Difference]: Start difference. First operand 132 states and 261 transitions. Second operand has 3 states, 2 states have (on average 3.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-13 02:22:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,209 INFO L93 Difference]: Finished difference Result 192 states and 391 transitions. [2022-07-13 02:22:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 6 [2022-07-13 02:22:22,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,211 INFO L225 Difference]: With dead ends: 192 [2022-07-13 02:22:22,211 INFO L226 Difference]: Without dead ends: 192 [2022-07-13 02:22:22,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:22,212 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-13 02:22:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2022-07-13 02:22:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 138 states have (on average 2.6884057971014492) internal successors, (371), 171 states have internal predecessors, (371), 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-13 02:22:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 371 transitions. [2022-07-13 02:22:22,235 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 371 transitions. Word has length 6 [2022-07-13 02:22:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,236 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 371 transitions. [2022-07-13 02:22:22,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-13 02:22:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 371 transitions. [2022-07-13 02:22:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 02:22:22,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,266 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-13 02:22:22,443 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-13 02:22:22,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,444 INFO L85 PathProgramCache]: Analyzing trace with hash -616036344, now seen corresponding path program 1 times [2022-07-13 02:22:22,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384075686] [2022-07-13 02:22:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,498 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-13 02:22:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384075686] [2022-07-13 02:22:22,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384075686] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:22,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893018855] [2022-07-13 02:22:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:22,512 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-13 02:22:22,549 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-13 02:22:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:22,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:22:22,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:22,620 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-13 02:22:22,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:22,650 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-13 02:22:22,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893018855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:22,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:22,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-13 02:22:22,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758405097] [2022-07-13 02:22:22,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:22:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:22,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:22:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:22,652 INFO L87 Difference]: Start difference. First operand 172 states and 371 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-13 02:22:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:22,716 INFO L93 Difference]: Finished difference Result 175 states and 374 transitions. [2022-07-13 02:22:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:22:22,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 6 [2022-07-13 02:22:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:22,717 INFO L225 Difference]: With dead ends: 175 [2022-07-13 02:22:22,717 INFO L226 Difference]: Without dead ends: 175 [2022-07-13 02:22:22,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:22,718 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:22,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-13 02:22:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-13 02:22:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 141 states have (on average 2.652482269503546) internal successors, (374), 174 states have internal predecessors, (374), 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-13 02:22:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 374 transitions. [2022-07-13 02:22:22,724 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 374 transitions. Word has length 6 [2022-07-13 02:22:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:22,724 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 374 transitions. [2022-07-13 02:22:22,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-13 02:22:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 374 transitions. [2022-07-13 02:22:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:22:22,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:22,724 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-13 02:22:22,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 02:22:22,941 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-13 02:22:22,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1771552911, now seen corresponding path program 2 times [2022-07-13 02:22:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:22,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34998935] [2022-07-13 02:22:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,007 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-13 02:22:23,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34998935] [2022-07-13 02:22:23,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34998935] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:23,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975471599] [2022-07-13 02:22:23,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:22:23,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:23,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:23,009 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-13 02:22:23,011 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-13 02:22:23,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:22:23,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:22:23,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:22:23,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:23,081 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-13 02:22:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:23,146 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-13 02:22:23,158 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-13 02:22:23,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:22:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975471599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:23,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:22:23,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-13 02:22:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896737068] [2022-07-13 02:22:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:22:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:22:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:22:23,160 INFO L87 Difference]: Start difference. First operand 175 states and 374 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-13 02:22:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,222 INFO L93 Difference]: Finished difference Result 201 states and 424 transitions. [2022-07-13 02:22:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:23,222 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-13 02:22:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,223 INFO L225 Difference]: With dead ends: 201 [2022-07-13 02:22:23,223 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 02:22:23,223 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-13 02:22:23,224 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 02:22:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2022-07-13 02:22:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 155 states have (on average 2.6) internal successors, (403), 188 states have internal predecessors, (403), 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-13 02:22:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 403 transitions. [2022-07-13 02:22:23,229 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 403 transitions. Word has length 9 [2022-07-13 02:22:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,229 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 403 transitions. [2022-07-13 02:22:23,229 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-13 02:22:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 403 transitions. [2022-07-13 02:22:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 02:22:23,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,230 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,246 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-13 02:22:23,445 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-13 02:22:23,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash -916434468, now seen corresponding path program 1 times [2022-07-13 02:22:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505483876] [2022-07-13 02:22:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,490 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-13 02:22:23,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505483876] [2022-07-13 02:22:23,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505483876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267692443] [2022-07-13 02:22:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:23,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:23,496 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-13 02:22:23,503 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-13 02:22:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:23,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 02:22:23,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:23,578 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-13 02:22:23,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:23,614 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-13 02:22:23,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267692443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:23,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:23,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-13 02:22:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831535331] [2022-07-13 02:22:23,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:23,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 02:22:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 02:22:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:22:23,616 INFO L87 Difference]: Start difference. First operand 189 states and 403 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-13 02:22:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:23,668 INFO L93 Difference]: Finished difference Result 195 states and 409 transitions. [2022-07-13 02:22:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:22:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-13 02:22:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:23,669 INFO L225 Difference]: With dead ends: 195 [2022-07-13 02:22:23,669 INFO L226 Difference]: Without dead ends: 195 [2022-07-13 02:22:23,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-13 02:22:23,670 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:23,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-13 02:22:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-13 02:22:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 2.540372670807453) internal successors, (409), 194 states have internal predecessors, (409), 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-13 02:22:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 409 transitions. [2022-07-13 02:22:23,675 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 409 transitions. Word has length 10 [2022-07-13 02:22:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:23,676 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 409 transitions. [2022-07-13 02:22:23,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-13 02:22:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 409 transitions. [2022-07-13 02:22:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:23,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:23,677 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:23,697 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-13 02:22:23,897 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-13 02:22:23,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash -346922884, now seen corresponding path program 2 times [2022-07-13 02:22:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487353642] [2022-07-13 02:22:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:23,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,000 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-13 02:22:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487353642] [2022-07-13 02:22:24,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487353642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053167785] [2022-07-13 02:22:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:24,002 INFO L87 Difference]: Start difference. First operand 195 states and 409 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-13 02:22:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,060 INFO L93 Difference]: Finished difference Result 201 states and 418 transitions. [2022-07-13 02:22:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:24,060 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-13 02:22:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,061 INFO L225 Difference]: With dead ends: 201 [2022-07-13 02:22:24,061 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 02:22:24,062 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-13 02:22:24,062 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 02:22:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2022-07-13 02:22:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 163 states have (on average 2.521472392638037) internal successors, (411), 196 states have internal predecessors, (411), 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-13 02:22:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 411 transitions. [2022-07-13 02:22:24,067 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 411 transitions. Word has length 16 [2022-07-13 02:22:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,067 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 411 transitions. [2022-07-13 02:22:24,067 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-13 02:22:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 411 transitions. [2022-07-13 02:22:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 02:22:24,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,068 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 02:22:24,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash -346921583, now seen corresponding path program 1 times [2022-07-13 02:22:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279530186] [2022-07-13 02:22:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,125 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-13 02:22:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279530186] [2022-07-13 02:22:24,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279530186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283359171] [2022-07-13 02:22:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:24,129 INFO L87 Difference]: Start difference. First operand 197 states and 411 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-13 02:22:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,189 INFO L93 Difference]: Finished difference Result 197 states and 410 transitions. [2022-07-13 02:22:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:22:24,190 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-13 02:22:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,192 INFO L225 Difference]: With dead ends: 197 [2022-07-13 02:22:24,192 INFO L226 Difference]: Without dead ends: 197 [2022-07-13 02:22:24,192 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-13 02:22:24,193 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-13 02:22:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-07-13 02:22:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 2.527950310559006) internal successors, (407), 194 states have internal predecessors, (407), 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-13 02:22:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 407 transitions. [2022-07-13 02:22:24,202 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 407 transitions. Word has length 16 [2022-07-13 02:22:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,203 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 407 transitions. [2022-07-13 02:22:24,203 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-13 02:22:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 407 transitions. [2022-07-13 02:22:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:24,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,204 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 02:22:24,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1614497445, now seen corresponding path program 1 times [2022-07-13 02:22:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476186925] [2022-07-13 02:22:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,255 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-13 02:22:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476186925] [2022-07-13 02:22:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476186925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:22:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913525483] [2022-07-13 02:22:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:22:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:22:24,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:22:24,257 INFO L87 Difference]: Start difference. First operand 195 states and 407 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-13 02:22:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,296 INFO L93 Difference]: Finished difference Result 213 states and 415 transitions. [2022-07-13 02:22:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:22:24,297 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-13 02:22:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,298 INFO L225 Difference]: With dead ends: 213 [2022-07-13 02:22:24,298 INFO L226 Difference]: Without dead ends: 213 [2022-07-13 02:22:24,298 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-13 02:22:24,298 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:22:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-13 02:22:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2022-07-13 02:22:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 161 states have (on average 2.4658385093167703) internal successors, (397), 194 states have internal predecessors, (397), 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-13 02:22:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 397 transitions. [2022-07-13 02:22:24,319 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 397 transitions. Word has length 18 [2022-07-13 02:22:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,319 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 397 transitions. [2022-07-13 02:22:24,319 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-13 02:22:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 397 transitions. [2022-07-13 02:22:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 02:22:24,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,320 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 02:22:24,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1615752332, now seen corresponding path program 1 times [2022-07-13 02:22:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527698681] [2022-07-13 02:22:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,371 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-13 02:22:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527698681] [2022-07-13 02:22:24,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527698681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:22:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610823243] [2022-07-13 02:22:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:22:24,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:22:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:22:24,373 INFO L87 Difference]: Start difference. First operand 195 states and 397 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-13 02:22:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,442 INFO L93 Difference]: Finished difference Result 258 states and 522 transitions. [2022-07-13 02:22:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:22:24,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-13 02:22:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,443 INFO L225 Difference]: With dead ends: 258 [2022-07-13 02:22:24,443 INFO L226 Difference]: Without dead ends: 258 [2022-07-13 02:22:24,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:24,444 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-13 02:22:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2022-07-13 02:22:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 205 states have (on average 2.419512195121951) internal successors, (496), 231 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-13 02:22:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 496 transitions. [2022-07-13 02:22:24,448 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 496 transitions. Word has length 18 [2022-07-13 02:22:24,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,449 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 496 transitions. [2022-07-13 02:22:24,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-13 02:22:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 496 transitions. [2022-07-13 02:22:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:22:24,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,450 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 02:22:24,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1490186839, now seen corresponding path program 1 times [2022-07-13 02:22:24,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114350502] [2022-07-13 02:22:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,534 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-13 02:22:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114350502] [2022-07-13 02:22:24,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114350502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:24,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:24,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:22:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704441508] [2022-07-13 02:22:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 02:22:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 02:22:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:22:24,536 INFO L87 Difference]: Start difference. First operand 232 states and 496 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-13 02:22:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,631 INFO L93 Difference]: Finished difference Result 288 states and 611 transitions. [2022-07-13 02:22:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:22:24,632 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-13 02:22:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,633 INFO L225 Difference]: With dead ends: 288 [2022-07-13 02:22:24,633 INFO L226 Difference]: Without dead ends: 288 [2022-07-13 02:22:24,633 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-13 02:22:24,634 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-13 02:22:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2022-07-13 02:22:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 235 states have (on average 2.3957446808510636) internal successors, (563), 261 states have internal predecessors, (563), 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-13 02:22:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 563 transitions. [2022-07-13 02:22:24,638 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 563 transitions. Word has length 19 [2022-07-13 02:22:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,638 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 563 transitions. [2022-07-13 02:22:24,638 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-13 02:22:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 563 transitions. [2022-07-13 02:22:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:22:24,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,640 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 02:22:24,640 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1490185798, now seen corresponding path program 1 times [2022-07-13 02:22:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:24,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405212069] [2022-07-13 02:22:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405212069] [2022-07-13 02:22:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405212069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804583310] [2022-07-13 02:22:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:24,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:24,693 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-13 02:22:24,694 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-13 02:22:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:24,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:22:24,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:24,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 02:22:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804583310] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:24,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-13 02:22:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76219116] [2022-07-13 02:22:24,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:24,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 02:22:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 02:22:24,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:22:24,809 INFO L87 Difference]: Start difference. First operand 262 states and 563 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-13 02:22:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:24,910 INFO L93 Difference]: Finished difference Result 416 states and 903 transitions. [2022-07-13 02:22:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 02:22:24,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-13 02:22:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:24,914 INFO L225 Difference]: With dead ends: 416 [2022-07-13 02:22:24,914 INFO L226 Difference]: Without dead ends: 416 [2022-07-13 02:22:24,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-13 02:22:24,914 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:24,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-13 02:22:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 354. [2022-07-13 02:22:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 331 states have (on average 2.525679758308157) internal successors, (836), 353 states have internal predecessors, (836), 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-13 02:22:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 836 transitions. [2022-07-13 02:22:24,921 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 836 transitions. Word has length 19 [2022-07-13 02:22:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:24,921 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 836 transitions. [2022-07-13 02:22:24,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 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-13 02:22:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 836 transitions. [2022-07-13 02:22:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:24,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:24,926 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:24,942 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-13 02:22:25,139 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,SelfDestructingSolverStorable11 [2022-07-13 02:22:25,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1048848633, now seen corresponding path program 1 times [2022-07-13 02:22:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:25,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192025554] [2022-07-13 02:22:25,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:25,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:25,330 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-13 02:22:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192025554] [2022-07-13 02:22:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192025554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:25,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:25,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533256720] [2022-07-13 02:22:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:25,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:25,331 INFO L87 Difference]: Start difference. First operand 354 states and 836 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-13 02:22:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:25,630 INFO L93 Difference]: Finished difference Result 375 states and 860 transitions. [2022-07-13 02:22:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:25,631 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-13 02:22:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:25,633 INFO L225 Difference]: With dead ends: 375 [2022-07-13 02:22:25,633 INFO L226 Difference]: Without dead ends: 375 [2022-07-13 02:22:25,633 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-13 02:22:25,633 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:25,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:22:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-13 02:22:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 353. [2022-07-13 02:22:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 330 states have (on average 2.518181818181818) internal successors, (831), 352 states have internal predecessors, (831), 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-13 02:22:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 831 transitions. [2022-07-13 02:22:25,641 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 831 transitions. Word has length 20 [2022-07-13 02:22:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:25,642 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 831 transitions. [2022-07-13 02:22:25,642 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-13 02:22:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 831 transitions. [2022-07-13 02:22:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:25,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:25,642 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:25,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 02:22:25,643 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-13 02:22:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1048881928, now seen corresponding path program 1 times [2022-07-13 02:22:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:25,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286382028] [2022-07-13 02:22:25,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:25,763 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-13 02:22:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:25,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286382028] [2022-07-13 02:22:25,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286382028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:25,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608635081] [2022-07-13 02:22:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:25,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:25,765 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-13 02:22:25,786 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-13 02:22:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:25,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:25,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:25,863 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-13 02:22:25,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:25,909 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-13 02:22:25,948 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-13 02:22:37,990 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-13 02:22:37,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:22:44,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_130| Int) (v_ArrVal_412 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129| Int) (v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_410) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_130| v_ArrVal_412) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_130|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|)))) is different from false [2022-07-13 02:22:44,954 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-13 02:22:44,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608635081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:22:44,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:22:44,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:22:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791945510] [2022-07-13 02:22:44,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:22:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:22:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:22:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:22:44,957 INFO L87 Difference]: Start difference. First operand 353 states and 831 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-13 02:22:44,961 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_130| Int) (v_ArrVal_412 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129| Int) (v_ArrVal_410 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int) (|v_ULTIMATE.start_main_~i~2#1_113| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_42|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_410) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_130| v_ArrVal_412) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_129|) (+ (* |v_ULTIMATE.start_main_~i~2#1_113| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_130|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_113|))))) is different from false [2022-07-13 02:22:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:45,547 INFO L93 Difference]: Finished difference Result 370 states and 855 transitions. [2022-07-13 02:22:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:22:45,547 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-13 02:22:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:45,549 INFO L225 Difference]: With dead ends: 370 [2022-07-13 02:22:45,549 INFO L226 Difference]: Without dead ends: 370 [2022-07-13 02:22:45,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-13 02:22:45,549 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:45,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 163 Unchecked, 0.1s Time] [2022-07-13 02:22:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-13 02:22:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 358. [2022-07-13 02:22:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 335 states have (on average 2.5104477611940297) internal successors, (841), 357 states have internal predecessors, (841), 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-13 02:22:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 841 transitions. [2022-07-13 02:22:45,556 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 841 transitions. Word has length 20 [2022-07-13 02:22:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:45,556 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 841 transitions. [2022-07-13 02:22:45,557 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-13 02:22:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 841 transitions. [2022-07-13 02:22:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:45,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:45,558 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:45,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:22:45,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:45,759 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-13 02:22:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1110038852, now seen corresponding path program 1 times [2022-07-13 02:22:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:45,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199695684] [2022-07-13 02:22:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:45,996 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-13 02:22:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199695684] [2022-07-13 02:22:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199695684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:45,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:45,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107960776] [2022-07-13 02:22:45,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:45,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:45,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:45,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:45,998 INFO L87 Difference]: Start difference. First operand 358 states and 841 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-13 02:22:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:46,120 INFO L93 Difference]: Finished difference Result 383 states and 882 transitions. [2022-07-13 02:22:46,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 02:22:46,123 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-13 02:22:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:46,125 INFO L225 Difference]: With dead ends: 383 [2022-07-13 02:22:46,125 INFO L226 Difference]: Without dead ends: 383 [2022-07-13 02:22:46,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:22:46,125 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:46,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-13 02:22:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2022-07-13 02:22:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 343 states have (on average 2.498542274052478) internal successors, (857), 365 states have internal predecessors, (857), 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-13 02:22:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 857 transitions. [2022-07-13 02:22:46,133 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 857 transitions. Word has length 20 [2022-07-13 02:22:46,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:46,134 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 857 transitions. [2022-07-13 02:22:46,135 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-13 02:22:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 857 transitions. [2022-07-13 02:22:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:46,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:46,135 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:46,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 02:22:46,136 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 399523502, now seen corresponding path program 2 times [2022-07-13 02:22:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:46,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138648933] [2022-07-13 02:22:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:46,252 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-13 02:22:46,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:46,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138648933] [2022-07-13 02:22:46,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138648933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:46,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:46,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453510730] [2022-07-13 02:22:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:46,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:46,253 INFO L87 Difference]: Start difference. First operand 366 states and 857 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-13 02:22:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:46,541 INFO L93 Difference]: Finished difference Result 391 states and 898 transitions. [2022-07-13 02:22:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:22:46,543 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-13 02:22:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:46,544 INFO L225 Difference]: With dead ends: 391 [2022-07-13 02:22:46,544 INFO L226 Difference]: Without dead ends: 391 [2022-07-13 02:22:46,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:22:46,545 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:46,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:22:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-13 02:22:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 365. [2022-07-13 02:22:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 342 states have (on average 2.5) internal successors, (855), 364 states have internal predecessors, (855), 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-13 02:22:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 855 transitions. [2022-07-13 02:22:46,552 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 855 transitions. Word has length 20 [2022-07-13 02:22:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:46,553 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 855 transitions. [2022-07-13 02:22:46,553 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-13 02:22:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 855 transitions. [2022-07-13 02:22:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:46,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:46,554 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 02:22:46,554 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:22:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 396981812, now seen corresponding path program 3 times [2022-07-13 02:22:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:46,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347975288] [2022-07-13 02:22:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:46,646 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-13 02:22:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:46,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347975288] [2022-07-13 02:22:46,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347975288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:22:46,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:22:46,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 02:22:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042987594] [2022-07-13 02:22:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:22:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:22:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:22:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:22:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:22:46,648 INFO L87 Difference]: Start difference. First operand 365 states and 855 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-13 02:22:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:22:46,865 INFO L93 Difference]: Finished difference Result 380 states and 873 transitions. [2022-07-13 02:22:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:22:46,865 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-13 02:22:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:22:46,866 INFO L225 Difference]: With dead ends: 380 [2022-07-13 02:22:46,866 INFO L226 Difference]: Without dead ends: 380 [2022-07-13 02:22:46,867 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-13 02:22:46,867 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:22:46,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:22:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-13 02:22:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 360. [2022-07-13 02:22:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 337 states have (on average 2.5014836795252227) internal successors, (843), 359 states have internal predecessors, (843), 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-13 02:22:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 843 transitions. [2022-07-13 02:22:46,873 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 843 transitions. Word has length 20 [2022-07-13 02:22:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:22:46,873 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 843 transitions. [2022-07-13 02:22:46,873 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-13 02:22:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 843 transitions. [2022-07-13 02:22:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 02:22:46,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:22:46,873 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:22:46,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 02:22:46,873 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-13 02:22:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:22:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2040146309, now seen corresponding path program 1 times [2022-07-13 02:22:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:22:46,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936279306] [2022-07-13 02:22:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:22:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:46,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-13 02:22:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:22:46,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936279306] [2022-07-13 02:22:46,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936279306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:22:46,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084518013] [2022-07-13 02:22:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:22:46,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:22:46,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:22:46,971 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-13 02:22:46,972 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-13 02:22:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:22:47,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:22:47,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:22:47,102 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-13 02:22:47,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:22:47,164 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-13 02:22:47,216 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-13 02:22:57,280 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-13 02:22:57,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:05,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_574 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (|v_t_funThread1of1ForFork0_~i~0#1_91| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_573 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_91| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| v_ArrVal_574) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_91|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) is different from false [2022-07-13 02:23:05,705 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-13 02:23:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084518013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:05,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-07-13 02:23:05,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417805777] [2022-07-13 02:23:05,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:05,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 02:23:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:05,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 02:23:05,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=241, Unknown=20, NotChecked=34, Total=380 [2022-07-13 02:23:05,709 INFO L87 Difference]: Start difference. First operand 360 states and 843 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-13 02:23:05,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_574 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (|v_t_funThread1of1ForFork0_~i~0#1_91| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_573 (Array Int Int)) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_91| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_573) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| v_ArrVal_574) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_91|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.offset| 0)) is different from false [2022-07-13 02:23:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:13,643 INFO L93 Difference]: Finished difference Result 386 states and 884 transitions. [2022-07-13 02:23:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:23:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-13 02:23:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:13,645 INFO L225 Difference]: With dead ends: 386 [2022-07-13 02:23:13,645 INFO L226 Difference]: Without dead ends: 386 [2022-07-13 02:23:13,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=126, Invalid=361, Unknown=27, NotChecked=86, Total=600 [2022-07-13 02:23:13,646 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:13,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 205 Unchecked, 0.1s Time] [2022-07-13 02:23:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-13 02:23:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 365. [2022-07-13 02:23:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 342 states have (on average 2.502923976608187) internal successors, (856), 364 states have internal predecessors, (856), 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-13 02:23:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 856 transitions. [2022-07-13 02:23:13,652 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 856 transitions. Word has length 20 [2022-07-13 02:23:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:13,652 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 856 transitions. [2022-07-13 02:23:13,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 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-13 02:23:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 856 transitions. [2022-07-13 02:23:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:13,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:13,654 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:13,673 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-13 02:23:13,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:13,855 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-13 02:23:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1844398523, now seen corresponding path program 1 times [2022-07-13 02:23:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:13,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136059895] [2022-07-13 02:23:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:14,003 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-13 02:23:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136059895] [2022-07-13 02:23:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136059895] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839795625] [2022-07-13 02:23:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:14,018 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-13 02:23:14,094 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-13 02:23:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:14,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:14,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:14,152 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-13 02:23:14,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:14,202 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-13 02:23:14,242 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-13 02:23:26,893 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-13 02:23:26,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:33,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132| Int) (|v_ULTIMATE.start_main_~i~2#1_118| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_645 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_118|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132|) (+ (* |v_ULTIMATE.start_main_~i~2#1_118| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_643) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_645) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132|) 2147483646))) is different from false [2022-07-13 02:23:33,330 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-13 02:23:33,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839795625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:33,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:33,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625172808] [2022-07-13 02:23:33,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:33,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:23:33,332 INFO L87 Difference]: Start difference. First operand 365 states and 856 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-13 02:23:33,339 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132| Int) (|v_ULTIMATE.start_main_~i~2#1_118| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_645 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_118|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_44|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132|) (+ (* |v_ULTIMATE.start_main_~i~2#1_118| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_643) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_133| v_ArrVal_645) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_132|) 2147483646))) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-13 02:23:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:34,192 INFO L93 Difference]: Finished difference Result 395 states and 907 transitions. [2022-07-13 02:23:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 02:23:34,193 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-13 02:23:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:34,194 INFO L225 Difference]: With dead ends: 395 [2022-07-13 02:23:34,194 INFO L226 Difference]: Without dead ends: 395 [2022-07-13 02:23:34,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-13 02:23:34,195 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:34,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 152 Unchecked, 0.1s Time] [2022-07-13 02:23:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-13 02:23:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 365. [2022-07-13 02:23:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 342 states have (on average 2.502923976608187) internal successors, (856), 364 states have internal predecessors, (856), 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-13 02:23:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 856 transitions. [2022-07-13 02:23:34,201 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 856 transitions. Word has length 21 [2022-07-13 02:23:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:34,201 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 856 transitions. [2022-07-13 02:23:34,201 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-13 02:23:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 856 transitions. [2022-07-13 02:23:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:34,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:34,201 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:34,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:23:34,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:34,416 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:23:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:34,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1844422703, now seen corresponding path program 2 times [2022-07-13 02:23:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994706067] [2022-07-13 02:23:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:34,535 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-13 02:23:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:34,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994706067] [2022-07-13 02:23:34,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994706067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:34,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138984104] [2022-07-13 02:23:34,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:23:34,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:34,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:34,537 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-13 02:23:34,538 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-13 02:23:34,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:23:34,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:23:34,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:34,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:34,621 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-13 02:23:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:34,673 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-13 02:23:34,722 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-13 02:23:44,054 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-13 02:23:44,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:23:50,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_714 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (|v_ULTIMATE.start_main_~i~2#1_122| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (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_713) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136| v_ArrVal_714) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|) (+ (* |v_ULTIMATE.start_main_~i~2#1_122| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_122|)))) is different from false [2022-07-13 02:23:50,558 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-13 02:23:50,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138984104] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:23:50,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:23:50,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:23:50,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82694987] [2022-07-13 02:23:50,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:23:50,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:23:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:23:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:23:50,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:23:50,560 INFO L87 Difference]: Start difference. First operand 365 states and 856 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-13 02:23:50,565 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_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_714 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135| Int) (|v_ULTIMATE.start_main_~i~2#1_122| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (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_713) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136| v_ArrVal_714) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|) 2147483646) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_135|) (+ (* |v_ULTIMATE.start_main_~i~2#1_122| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_136|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_122|))))) is different from false [2022-07-13 02:23:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:23:51,143 INFO L93 Difference]: Finished difference Result 376 states and 869 transitions. [2022-07-13 02:23:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:23:51,143 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-13 02:23:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:23:51,145 INFO L225 Difference]: With dead ends: 376 [2022-07-13 02:23:51,145 INFO L226 Difference]: Without dead ends: 376 [2022-07-13 02:23:51,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-13 02:23:51,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:23:51,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 294 Unchecked, 0.1s Time] [2022-07-13 02:23:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-13 02:23:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2022-07-13 02:23:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 341 states have (on average 2.504398826979472) internal successors, (854), 363 states have internal predecessors, (854), 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-13 02:23:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 854 transitions. [2022-07-13 02:23:51,151 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 854 transitions. Word has length 21 [2022-07-13 02:23:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:23:51,152 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 854 transitions. [2022-07-13 02:23:51,152 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-13 02:23:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 854 transitions. [2022-07-13 02:23:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:23:51,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:23:51,152 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:23:51,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:23:51,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:51,368 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-13 02:23:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:23:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1179973937, now seen corresponding path program 1 times [2022-07-13 02:23:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:23:51,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618073512] [2022-07-13 02:23:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:23:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:51,461 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-13 02:23:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:23:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618073512] [2022-07-13 02:23:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618073512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:23:51,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081163818] [2022-07-13 02:23:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:23:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:23:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:23:51,470 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-13 02:23:51,476 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-13 02:23:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:23:51,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:23:51,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:23:51,558 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-13 02:23:51,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:23:51,606 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-13 02:23:51,650 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-13 02:24:01,294 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-13 02:24:01,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:08,234 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_785 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (v_ArrVal_783 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_99| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_783) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_785) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|)))) is different from false [2022-07-13 02:24:08,334 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-13 02:24:08,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081163818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:08,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:08,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:24:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029892705] [2022-07-13 02:24:08,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:08,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:24:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:24:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:24:08,336 INFO L87 Difference]: Start difference. First operand 364 states and 854 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-13 02:24:08,340 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_ArrVal_785 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (v_ArrVal_783 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_99| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_46|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_783) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_785) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|))))) is different from false [2022-07-13 02:24:15,767 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_~i~0#1_99| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 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_785)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646) (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|)))) (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (|v_t_funThread1of1ForFork0_~i~0#1_99| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_785) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|))))) is different from false [2022-07-13 02:24:16,256 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_785 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int) (|v_t_funThread1of1ForFork0_~i~0#1_99| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_785) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|)))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_99| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_99| 28) |c_~#cache~0.offset|)) (<= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646))) (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_99|))))) is different from false [2022-07-13 02:24:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:24:22,312 INFO L93 Difference]: Finished difference Result 376 states and 880 transitions. [2022-07-13 02:24:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:24:22,313 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-13 02:24:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:24:22,314 INFO L225 Difference]: With dead ends: 376 [2022-07-13 02:24:22,314 INFO L226 Difference]: Without dead ends: 376 [2022-07-13 02:24:22,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=120, Invalid=323, Unknown=35, NotChecked=172, Total=650 [2022-07-13 02:24:22,315 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:24:22,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 141 Unchecked, 0.0s Time] [2022-07-13 02:24:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-13 02:24:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2022-07-13 02:24:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 341 states have (on average 2.504398826979472) internal successors, (854), 363 states have internal predecessors, (854), 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-13 02:24:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 854 transitions. [2022-07-13 02:24:22,332 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 854 transitions. Word has length 21 [2022-07-13 02:24:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:24:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 854 transitions. [2022-07-13 02:24:22,332 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-13 02:24:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 854 transitions. [2022-07-13 02:24:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 02:24:22,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:24:22,333 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:24:22,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 02:24:22,546 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,SelfDestructingSolverStorable20 [2022-07-13 02:24:22,546 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:24:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:24:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1179938597, now seen corresponding path program 2 times [2022-07-13 02:24:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:24:22,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767386399] [2022-07-13 02:24:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:24:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:24:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:24:22,672 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-13 02:24:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:24:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767386399] [2022-07-13 02:24:22,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767386399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:24:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885321451] [2022-07-13 02:24:22,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:24:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:24:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:24:22,684 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-13 02:24:22,685 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-13 02:24:22,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:24:22,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:24:22,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:24:22,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:24:22,779 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-13 02:24:22,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:24:22,836 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-13 02:24:22,878 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-13 02:24:38,733 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-13 02:24:38,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:24:48,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_103| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (v_ArrVal_855 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_103| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_853) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| v_ArrVal_855) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_103|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) is different from false [2022-07-13 02:24:48,271 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-13 02:24:48,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885321451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:24:48,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:24:48,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-07-13 02:24:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548374201] [2022-07-13 02:24:48,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:24:48,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 02:24:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:24:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 02:24:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=239, Unknown=23, NotChecked=34, Total=380 [2022-07-13 02:24:48,275 INFO L87 Difference]: Start difference. First operand 364 states and 854 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:24:48,279 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_ArrVal_853 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_103| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (v_ArrVal_855 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_103| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_853) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| v_ArrVal_855) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) 2147483646) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_103|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)))) (= |c_~#cache~0.offset| 0)) is different from false [2022-07-13 02:25:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:03,666 INFO L93 Difference]: Finished difference Result 373 states and 875 transitions. [2022-07-13 02:25:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:25:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 02:25:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:03,668 INFO L225 Difference]: With dead ends: 373 [2022-07-13 02:25:03,668 INFO L226 Difference]: Without dead ends: 373 [2022-07-13 02:25:03,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=125, Invalid=358, Unknown=31, NotChecked=86, Total=600 [2022-07-13 02:25:03,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 157 Unchecked, 0.1s Time] [2022-07-13 02:25:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-13 02:25:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2022-07-13 02:25:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 338 states have (on average 2.5059171597633134) internal successors, (847), 360 states have internal predecessors, (847), 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-13 02:25:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 847 transitions. [2022-07-13 02:25:03,682 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 847 transitions. Word has length 21 [2022-07-13 02:25:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:03,683 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 847 transitions. [2022-07-13 02:25:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:25:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 847 transitions. [2022-07-13 02:25:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:03,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:03,684 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:03,702 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-13 02:25:03,884 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,SelfDestructingSolverStorable21 [2022-07-13 02:25:03,884 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-13 02:25:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1373798041, now seen corresponding path program 1 times [2022-07-13 02:25:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:03,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910148118] [2022-07-13 02:25:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:03,963 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-13 02:25:03,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:03,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910148118] [2022-07-13 02:25:03,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910148118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:03,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376402159] [2022-07-13 02:25:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:03,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:03,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:03,965 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-13 02:25:03,966 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-13 02:25:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:04,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:04,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:04,056 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-13 02:25:04,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:04,111 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-13 02:25:04,146 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-13 02:25:13,860 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-13 02:25:13,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:20,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_48| Int) (v_ArrVal_928 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_927 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_927) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| v_ArrVal_928) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) 2147483646))) is different from false [2022-07-13 02:25:20,565 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-13 02:25:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376402159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:20,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:20,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:25:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392861666] [2022-07-13 02:25:20,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:20,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:25:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:25:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-13 02:25:20,567 INFO L87 Difference]: Start difference. First operand 361 states and 847 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-13 02:25:20,571 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_48| Int) (v_ArrVal_928 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (v_ArrVal_927 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_48|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_48| v_ArrVal_927) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| v_ArrVal_928) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) 2147483646)))) is different from false [2022-07-13 02:25:21,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_928 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| v_ArrVal_928) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| (* |v_ULTIMATE.start_main_~i~2#1_130| 28))))) (or (= .cse0 .cse1) (<= (+ 28 .cse2) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)))))) is different from false [2022-07-13 02:25:22,908 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_928 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| (+ (* |v_ULTIMATE.start_main_~i~2#1_130| 28) |c_~#cache~0.offset|)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_928)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) 2147483646))) (forall ((v_ArrVal_928 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138| Int) (|v_ULTIMATE.start_main_~i~2#1_130| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| v_ArrVal_928) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_130|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_138|) (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_139| (* |v_ULTIMATE.start_main_~i~2#1_130| 28)))))) is different from false [2022-07-13 02:25:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:23,917 INFO L93 Difference]: Finished difference Result 386 states and 887 transitions. [2022-07-13 02:25:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:25:23,917 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-13 02:25:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:23,919 INFO L225 Difference]: With dead ends: 386 [2022-07-13 02:25:23,919 INFO L226 Difference]: Without dead ends: 386 [2022-07-13 02:25:23,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=113, Invalid=301, Unknown=22, NotChecked=164, Total=600 [2022-07-13 02:25:23,919 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:23,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 170 Unchecked, 0.0s Time] [2022-07-13 02:25:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-13 02:25:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 363. [2022-07-13 02:25:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 340 states have (on average 2.5029411764705882) internal successors, (851), 362 states have internal predecessors, (851), 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-13 02:25:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 851 transitions. [2022-07-13 02:25:23,926 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 851 transitions. Word has length 22 [2022-07-13 02:25:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:23,926 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 851 transitions. [2022-07-13 02:25:23,926 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-13 02:25:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 851 transitions. [2022-07-13 02:25:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:23,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:23,944 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:23,960 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-13 02:25:24,155 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,SelfDestructingSolverStorable22 [2022-07-13 02:25:24,156 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1341841871, now seen corresponding path program 1 times [2022-07-13 02:25:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:24,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034050669] [2022-07-13 02:25:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:24,187 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-13 02:25:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034050669] [2022-07-13 02:25:24,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034050669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:25:24,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:25:24,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:25:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74838120] [2022-07-13 02:25:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:25:24,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:25:24,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:24,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:25:24,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:25:24,189 INFO L87 Difference]: Start difference. First operand 363 states and 851 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-13 02:25:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:24,241 INFO L93 Difference]: Finished difference Result 350 states and 797 transitions. [2022-07-13 02:25:24,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:25:24,241 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-13 02:25:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:24,242 INFO L225 Difference]: With dead ends: 350 [2022-07-13 02:25:24,242 INFO L226 Difference]: Without dead ends: 350 [2022-07-13 02:25:24,242 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-13 02:25:24,243 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 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-13 02:25:24,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:25:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-13 02:25:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-07-13 02:25:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 331 states have (on average 2.40785498489426) internal successors, (797), 349 states have internal predecessors, (797), 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-13 02:25:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 797 transitions. [2022-07-13 02:25:24,249 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 797 transitions. Word has length 22 [2022-07-13 02:25:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:24,249 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 797 transitions. [2022-07-13 02:25:24,249 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-13 02:25:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 797 transitions. [2022-07-13 02:25:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:24,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:24,250 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 02:25:24,250 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1342517491, now seen corresponding path program 2 times [2022-07-13 02:25:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:24,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323373400] [2022-07-13 02:25:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:24,332 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-13 02:25:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323373400] [2022-07-13 02:25:24,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323373400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988520627] [2022-07-13 02:25:24,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:25:24,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:24,334 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-13 02:25:24,335 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-13 02:25:24,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:25:24,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:25:24,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:25:24,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:24,433 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-13 02:25:24,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:24,479 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-13 02:25:24,543 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-13 02:25:29,644 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-13 02:25:29,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:25:46,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int) (|v_ULTIMATE.start_main_~i~2#1_134| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| (+ (* |v_ULTIMATE.start_main_~i~2#1_134| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (not (<= 1 |v_ULTIMATE.start_main_~i~2#1_134|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1038) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142| v_ArrVal_1039) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|) 2147483646))) is different from false [2022-07-13 02:25:46,876 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-13 02:25:46,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988520627] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:25:46,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:25:46,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-07-13 02:25:46,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193266046] [2022-07-13 02:25:46,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:25:46,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 02:25:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:25:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 02:25:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=293, Unknown=24, NotChecked=38, Total=462 [2022-07-13 02:25:46,878 INFO L87 Difference]: Start difference. First operand 350 states and 797 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-13 02:25:46,883 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_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_49| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int) (|v_ULTIMATE.start_main_~i~2#1_134| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141| (+ (* |v_ULTIMATE.start_main_~i~2#1_134| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (not (<= 1 |v_ULTIMATE.start_main_~i~2#1_134|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_49| v_ArrVal_1038) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_142| v_ArrVal_1039) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_141|) 2147483646)))) is different from false [2022-07-13 02:25:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:25:48,659 INFO L93 Difference]: Finished difference Result 366 states and 819 transitions. [2022-07-13 02:25:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:25:48,660 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-13 02:25:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:25:48,661 INFO L225 Difference]: With dead ends: 366 [2022-07-13 02:25:48,661 INFO L226 Difference]: Without dead ends: 366 [2022-07-13 02:25:48,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=126, Invalid=363, Unknown=25, NotChecked=86, Total=600 [2022-07-13 02:25:48,662 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:25:48,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 420 Unchecked, 0.1s Time] [2022-07-13 02:25:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-13 02:25:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 341. [2022-07-13 02:25:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 322 states have (on average 2.4161490683229814) internal successors, (778), 340 states have internal predecessors, (778), 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-13 02:25:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 778 transitions. [2022-07-13 02:25:48,669 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 778 transitions. Word has length 22 [2022-07-13 02:25:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:25:48,669 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 778 transitions. [2022-07-13 02:25:48,669 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-13 02:25:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 778 transitions. [2022-07-13 02:25:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:25:48,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:25:48,670 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:25:48,688 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-13 02:25:48,883 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,SelfDestructingSolverStorable24 [2022-07-13 02:25:48,884 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:25:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:25:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -752290858, now seen corresponding path program 1 times [2022-07-13 02:25:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:25:48,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112818921] [2022-07-13 02:25:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:25:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:48,969 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-13 02:25:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:25:48,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112818921] [2022-07-13 02:25:48,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112818921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:25:48,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283738252] [2022-07-13 02:25:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:25:48,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:25:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:25:48,972 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-13 02:25:48,975 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-13 02:25:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:25:49,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:25:49,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:25:49,070 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-13 02:25:49,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:25:49,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, 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-13 02:25:49,156 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-13 02:26:03,865 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-13 02:26:03,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:26:11,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| Int) (|v_t_funThread1of1ForFork0_~i~0#1_111| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_111|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1112) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| v_ArrVal_1114) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| (* |v_t_funThread1of1ForFork0_~i~0#1_111| 28))))) is different from false [2022-07-13 02:26:11,463 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-13 02:26:11,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283738252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:26:11,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:26:11,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-13 02:26:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185166363] [2022-07-13 02:26:11,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:26:11,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:26:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:26:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-13 02:26:11,464 INFO L87 Difference]: Start difference. First operand 341 states and 778 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-13 02:26:11,469 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_180| Int) (|v_t_funThread1of1ForFork0_~i~0#1_111| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1114 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_50| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_50|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_111|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_50| v_ArrVal_1112) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| v_ArrVal_1114) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|) 2147483646) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| (* |v_t_funThread1of1ForFork0_~i~0#1_111| 28)))))) is different from false [2022-07-13 02:26:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:14,859 INFO L93 Difference]: Finished difference Result 377 states and 840 transitions. [2022-07-13 02:26:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 02:26:14,860 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-13 02:26:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:14,861 INFO L225 Difference]: With dead ends: 377 [2022-07-13 02:26:14,862 INFO L226 Difference]: Without dead ends: 377 [2022-07-13 02:26:14,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=101, Invalid=267, Unknown=20, NotChecked=74, Total=462 [2022-07-13 02:26:14,863 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:14,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2022-07-13 02:26:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-13 02:26:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 343. [2022-07-13 02:26:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 324 states have (on average 2.4166666666666665) internal successors, (783), 342 states have internal predecessors, (783), 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-13 02:26:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 783 transitions. [2022-07-13 02:26:14,879 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 783 transitions. Word has length 22 [2022-07-13 02:26:14,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:14,879 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 783 transitions. [2022-07-13 02:26:14,879 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-13 02:26:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 783 transitions. [2022-07-13 02:26:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:14,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:14,880 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:14,897 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-13 02:26:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:15,096 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-13 02:26:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -752301088, now seen corresponding path program 2 times [2022-07-13 02:26:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:15,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660684308] [2022-07-13 02:26:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:15,207 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-13 02:26:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660684308] [2022-07-13 02:26:15,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660684308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:26:15,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903891200] [2022-07-13 02:26:15,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:26:15,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:15,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:26:15,213 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-13 02:26:15,214 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-13 02:26:15,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:26:15,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:26:15,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:26:15,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:26:15,319 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-13 02:26:15,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:26:15,373 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-13 02:26:15,453 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-13 02:26:20,505 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-13 02:26:20,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:26:37,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_115| Int) (v_ArrVal_1187 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184| Int) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_51| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_115|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_51| v_ArrVal_1186) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184| v_ArrVal_1187) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183|) 2147483646) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_115| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184|)))) is different from false [2022-07-13 02:26:37,612 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-13 02:26:37,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903891200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:26:37,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:26:37,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 22 [2022-07-13 02:26:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383780493] [2022-07-13 02:26:37,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:26:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 02:26:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:26:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 02:26:37,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=372, Unknown=24, NotChecked=42, Total=552 [2022-07-13 02:26:37,614 INFO L87 Difference]: Start difference. First operand 343 states and 783 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-13 02:26:37,619 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|)) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_115| Int) (v_ArrVal_1187 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184| Int) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_51| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (not (<= 1 |v_t_funThread1of1ForFork0_~i~0#1_115|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_51| v_ArrVal_1186) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184| v_ArrVal_1187) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183|) 2147483646) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_183| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_115| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_184|))))) is different from false [2022-07-13 02:26:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:26:45,115 INFO L93 Difference]: Finished difference Result 392 states and 868 transitions. [2022-07-13 02:26:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 02:26:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-13 02:26:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:26:45,117 INFO L225 Difference]: With dead ends: 392 [2022-07-13 02:26:45,117 INFO L226 Difference]: Without dead ends: 392 [2022-07-13 02:26:45,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=244, Invalid=789, Unknown=31, NotChecked=126, Total=1190 [2022-07-13 02:26:45,118 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:26:45,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 320 Unchecked, 0.1s Time] [2022-07-13 02:26:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-13 02:26:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 343. [2022-07-13 02:26:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 324 states have (on average 2.4135802469135803) internal successors, (782), 342 states have internal predecessors, (782), 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-13 02:26:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 782 transitions. [2022-07-13 02:26:45,126 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 782 transitions. Word has length 22 [2022-07-13 02:26:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:26:45,126 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 782 transitions. [2022-07-13 02:26:45,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-13 02:26:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 782 transitions. [2022-07-13 02:26:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 02:26:45,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:26:45,126 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:26:45,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 02:26:45,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 02:26:45,327 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-13 02:26:45,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:26:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2075512704, now seen corresponding path program 3 times [2022-07-13 02:26:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:26:45,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348379065] [2022-07-13 02:26:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:26:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:26:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:26:45,441 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-13 02:26:45,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:26:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348379065] [2022-07-13 02:26:45,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348379065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:26:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666722237] [2022-07-13 02:26:45,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 02:26:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:26:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:26:45,443 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-13 02:26:45,444 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-13 02:26:45,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 02:26:45,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:26:45,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:26:45,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:26:45,559 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-13 02:26:45,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 02:26:45,621 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-13 02:26:45,682 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-13 02:27:02,004 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-13 02:27:02,004 INFO L328 TraceCheckSpWp]: Computing backward predicates...