./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_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-?-f4b24e3 [2022-07-14 14:03:25,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:03:25,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:03:25,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:03:25,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:03:25,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:03:25,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:03:25,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:03:25,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:03:25,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:03:25,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:03:25,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:03:25,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:03:25,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:03:25,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:03:25,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:03:25,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:03:25,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:03:25,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:03:25,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:03:25,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:03:25,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:03:25,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:03:25,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:03:25,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:03:25,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:03:25,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:03:25,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:03:25,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:03:25,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:03:25,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:03:25,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:03:25,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:03:25,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:03:25,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:03:25,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:03:25,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:03:25,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:03:25,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:03:25,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:03:25,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:03:25,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:03:25,321 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 14:03:25,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:03:25,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:03:25,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:03:25,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:03:25,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 14:03:25,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 14:03:25,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:03:25,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:03:25,356 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:03:25,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:03:25,357 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 14:03:25,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:03:25,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:03:25,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 14:03:25,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:03:25,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 14:03:25,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 14:03:25,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 14:03:25,359 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 14:03:25,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 14:03:25,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:03:25,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:03:25,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 14:03:25,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:03:25,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:03:25,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 14:03:25,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:25,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:03:25,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 14:03:25,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 14:03:25,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:03:25,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 14:03:25,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 14:03:25,362 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-14 14:03:25,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:03:25,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:03:25,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:03:25,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:03:25,647 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:03:25,648 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-14 14:03:25,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73cbe0a2/7c41994797c648739db68b77cce7c85e/FLAG26d6b55d6 [2022-07-14 14:03:26,186 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:03:26,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-07-14 14:03:26,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73cbe0a2/7c41994797c648739db68b77cce7c85e/FLAG26d6b55d6 [2022-07-14 14:03:26,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e73cbe0a2/7c41994797c648739db68b77cce7c85e [2022-07-14 14:03:26,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:03:26,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:03:26,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:26,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:03:26,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:03:26,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cad99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:26, skipping insertion in model container [2022-07-14 14:03:26,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:26" (1/1) ... [2022-07-14 14:03:26,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:03:26,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:03:27,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:27,104 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:03:27,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:27,217 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:03:27,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27 WrapperNode [2022-07-14 14:03:27,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:27,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:27,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:03:27,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:03:27,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,277 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-07-14 14:03:27,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:27,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:03:27,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:03:27,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:03:27,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:03:27,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:03:27,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:03:27,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:03:27,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (1/1) ... [2022-07-14 14:03:27,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:27,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:27,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 14:03:27,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 14:03:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:03:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:03:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:03:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:03:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-14 14:03:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 14:03:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-14 14:03:27,398 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-14 14:03:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:03:27,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:03:27,400 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-14 14:03:27,552 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:03:27,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:03:27,755 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:03:27,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:03:27,763 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 14:03:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:27 BoogieIcfgContainer [2022-07-14 14:03:27,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:03:27,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 14:03:27,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 14:03:27,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 14:03:27,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 02:03:26" (1/3) ... [2022-07-14 14:03:27,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae5ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:27, skipping insertion in model container [2022-07-14 14:03:27,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:27" (2/3) ... [2022-07-14 14:03:27,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ae5ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:27, skipping insertion in model container [2022-07-14 14:03:27,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:27" (3/3) ... [2022-07-14 14:03:27,776 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-07-14 14:03:27,781 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-14 14:03:27,789 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 14:03:27,790 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-07-14 14:03:27,790 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-14 14:03:27,854 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-14 14:03:27,882 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-14 14:03:27,893 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 107 transitions, 219 flow [2022-07-14 14:03:27,902 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 107 transitions, 219 flow [2022-07-14 14:03:27,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 219 flow [2022-07-14 14:03:27,955 INFO L129 PetriNetUnfolder]: 6/106 cut-off events. [2022-07-14 14:03:27,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-14 14:03:27,959 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-14 14:03:27,962 INFO L116 LiptonReduction]: Number of co-enabled transitions 2880 [2022-07-14 14:03:30,486 INFO L131 LiptonReduction]: Checked pairs total: 3768 [2022-07-14 14:03:30,486 INFO L133 LiptonReduction]: Total number of compositions: 109 [2022-07-14 14:03:30,495 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 30 transitions, 65 flow [2022-07-14 14:03:30,529 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-14 14:03:30,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 14:03:30,555 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@18611a58, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c307571 [2022-07-14 14:03:30,556 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-07-14 14:03:30,558 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-14 14:03:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-14 14:03:30,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-14 14:03:30,563 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-14 14:03:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 13261, now seen corresponding path program 1 times [2022-07-14 14:03:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464498318] [2022-07-14 14:03:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464498318] [2022-07-14 14:03:30,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464498318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:30,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:30,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 14:03:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598030359] [2022-07-14 14:03:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:30,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:30,785 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-14 14:03:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,852 INFO L93 Difference]: Finished difference Result 132 states and 262 transitions. [2022-07-14 14:03:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:30,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-07-14 14:03:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,866 INFO L225 Difference]: With dead ends: 132 [2022-07-14 14:03:30,867 INFO L226 Difference]: Without dead ends: 131 [2022-07-14 14:03:30,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:30,873 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,877 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.0s Time] [2022-07-14 14:03:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-14 14:03:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-14 14:03:30,940 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-14 14:03:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 260 transitions. [2022-07-14 14:03:30,947 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 260 transitions. Word has length 2 [2022-07-14 14:03:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,947 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 260 transitions. [2022-07-14 14:03:30,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 260 transitions. [2022-07-14 14:03:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 14:03:30,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 14:03:30,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 14:03:30,949 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-14 14:03:30,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 395156038, now seen corresponding path program 1 times [2022-07-14 14:03:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895615285] [2022-07-14 14:03:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895615285] [2022-07-14 14:03:31,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895615285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:31,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:31,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626822739] [2022-07-14 14:03:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:31,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:31,008 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-14 14:03:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,048 INFO L93 Difference]: Finished difference Result 132 states and 261 transitions. [2022-07-14 14:03:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:31,050 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-14 14:03:31,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,051 INFO L225 Difference]: With dead ends: 132 [2022-07-14 14:03:31,052 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 14:03:31,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:31,054 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:31,056 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.0s Time] [2022-07-14 14:03:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 14:03:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-14 14:03:31,069 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-14 14:03:31,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 261 transitions. [2022-07-14 14:03:31,071 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 261 transitions. Word has length 5 [2022-07-14 14:03:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,072 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 261 transitions. [2022-07-14 14:03:31,072 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-14 14:03:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 261 transitions. [2022-07-14 14:03:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 14:03:31,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 14:03:31,074 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-14 14:03:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash -616036353, now seen corresponding path program 1 times [2022-07-14 14:03:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124789524] [2022-07-14 14:03:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124789524] [2022-07-14 14:03:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124789524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374096624] [2022-07-14 14:03:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:31,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:31,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 14:03:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:03:31,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:31,238 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-14 14:03:31,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:03:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374096624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:31,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:03:31,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-07-14 14:03:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279398762] [2022-07-14 14:03:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:31,250 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-14 14:03:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,313 INFO L93 Difference]: Finished difference Result 192 states and 391 transitions. [2022-07-14 14:03:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:31,314 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-14 14:03:31,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,315 INFO L225 Difference]: With dead ends: 192 [2022-07-14 14:03:31,316 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 14:03:31,316 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-14 14:03:31,317 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-14 14:03:31,317 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-14 14:03:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 14:03:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2022-07-14 14:03:31,339 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-14 14:03:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 371 transitions. [2022-07-14 14:03:31,341 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 371 transitions. Word has length 6 [2022-07-14 14:03:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,341 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 371 transitions. [2022-07-14 14:03:31,341 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-14 14:03:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 371 transitions. [2022-07-14 14:03:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 14:03:31,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:31,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,564 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-14 14:03:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -616036344, now seen corresponding path program 1 times [2022-07-14 14:03:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964694505] [2022-07-14 14:03:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964694505] [2022-07-14 14:03:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964694505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:31,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911838007] [2022-07-14 14:03:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:31,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:31,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 14:03:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:31,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:03:31,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:31,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911838007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:31,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:31,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-14 14:03:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659266910] [2022-07-14 14:03:31,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:31,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 14:03:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:03:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:31,704 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-14 14:03:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:31,782 INFO L93 Difference]: Finished difference Result 175 states and 374 transitions. [2022-07-14 14:03:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:03:31,783 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-14 14:03:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:31,784 INFO L225 Difference]: With dead ends: 175 [2022-07-14 14:03:31,785 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 14:03:31,785 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-14 14:03:31,786 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 14:03:31,786 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-14 14:03:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 14:03:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-14 14:03:31,794 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-14 14:03:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 374 transitions. [2022-07-14 14:03:31,795 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 374 transitions. Word has length 6 [2022-07-14 14:03:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:31,795 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 374 transitions. [2022-07-14 14:03:31,796 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-14 14:03:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 374 transitions. [2022-07-14 14:03:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 14:03:31,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:31,797 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-14 14:03:31,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:32,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-14 14:03:32,016 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-14 14:03:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1771552911, now seen corresponding path program 2 times [2022-07-14 14:03:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259609039] [2022-07-14 14:03:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259609039] [2022-07-14 14:03:32,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259609039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223502597] [2022-07-14 14:03:32,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:03:32,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:32,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:32,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:32,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 14:03:32,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 14:03:32,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:03:32,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 14:03:32,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:32,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:32,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:32,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 14:03:32,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:03:32,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223502597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:32,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:03:32,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-14 14:03:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227743978] [2022-07-14 14:03:32,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 14:03:32,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:03:32,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:03:32,313 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-14 14:03:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,405 INFO L93 Difference]: Finished difference Result 201 states and 424 transitions. [2022-07-14 14:03:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:32,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 14:03:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,408 INFO L225 Difference]: With dead ends: 201 [2022-07-14 14:03:32,408 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 14:03:32,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:03:32,409 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 14:03:32,410 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-14 14:03:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 14:03:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2022-07-14 14:03:32,418 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-14 14:03:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 403 transitions. [2022-07-14 14:03:32,419 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 403 transitions. Word has length 9 [2022-07-14 14:03:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,420 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 403 transitions. [2022-07-14 14:03:32,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 403 transitions. [2022-07-14 14:03:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 14:03:32,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,421 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:32,639 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-14 14:03:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -916434468, now seen corresponding path program 1 times [2022-07-14 14:03:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624791770] [2022-07-14 14:03:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:32,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:32,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624791770] [2022-07-14 14:03:32,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624791770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:32,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269469847] [2022-07-14 14:03:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:32,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:32,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:32,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:32,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 14:03:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:32,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:03:32,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:32,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269469847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:32,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:32,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-14 14:03:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743491288] [2022-07-14 14:03:32,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:32,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 14:03:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:32,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 14:03:32,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-14 14:03:32,845 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-14 14:03:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:32,927 INFO L93 Difference]: Finished difference Result 195 states and 409 transitions. [2022-07-14 14:03:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:03:32,928 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-14 14:03:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:32,929 INFO L225 Difference]: With dead ends: 195 [2022-07-14 14:03:32,929 INFO L226 Difference]: Without dead ends: 195 [2022-07-14 14:03:32,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-14 14:03:32,934 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:32,935 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.1s Time] [2022-07-14 14:03:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-14 14:03:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-14 14:03:32,958 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-14 14:03:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 409 transitions. [2022-07-14 14:03:32,961 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 409 transitions. Word has length 10 [2022-07-14 14:03:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:32,961 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 409 transitions. [2022-07-14 14:03:32,961 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-14 14:03:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 409 transitions. [2022-07-14 14:03:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:32,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:32,962 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:32,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 14:03:33,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:33,176 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-14 14:03:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash -346922884, now seen corresponding path program 2 times [2022-07-14 14:03:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944119235] [2022-07-14 14:03:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944119235] [2022-07-14 14:03:33,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944119235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:33,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:33,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:33,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672529348] [2022-07-14 14:03:33,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:33,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:33,333 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-14 14:03:33,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,404 INFO L93 Difference]: Finished difference Result 201 states and 418 transitions. [2022-07-14 14:03:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:33,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 14:03:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,406 INFO L225 Difference]: With dead ends: 201 [2022-07-14 14:03:33,406 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 14:03:33,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:33,408 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:33,409 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.1s Time] [2022-07-14 14:03:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 14:03:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2022-07-14 14:03:33,416 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-14 14:03:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 411 transitions. [2022-07-14 14:03:33,417 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 411 transitions. Word has length 16 [2022-07-14 14:03:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,417 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 411 transitions. [2022-07-14 14:03:33,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 411 transitions. [2022-07-14 14:03:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:33,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,418 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 14:03:33,419 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-14 14:03:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -346921583, now seen corresponding path program 1 times [2022-07-14 14:03:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049847885] [2022-07-14 14:03:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049847885] [2022-07-14 14:03:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049847885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:33,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:33,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712393493] [2022-07-14 14:03:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:33,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:33,523 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-14 14:03:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,590 INFO L93 Difference]: Finished difference Result 197 states and 410 transitions. [2022-07-14 14:03:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:33,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 14:03:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,592 INFO L225 Difference]: With dead ends: 197 [2022-07-14 14:03:33,592 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 14:03:33,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:33,594 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:33,594 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.1s Time] [2022-07-14 14:03:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 14:03:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2022-07-14 14:03:33,599 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-14 14:03:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 407 transitions. [2022-07-14 14:03:33,600 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 407 transitions. Word has length 16 [2022-07-14 14:03:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,600 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 407 transitions. [2022-07-14 14:03:33,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 407 transitions. [2022-07-14 14:03:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:33,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,602 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 14:03:33,603 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-14 14:03:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1614497445, now seen corresponding path program 1 times [2022-07-14 14:03:33,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153644574] [2022-07-14 14:03:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,642 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153644574] [2022-07-14 14:03:33,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153644574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:33,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:33,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684883592] [2022-07-14 14:03:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:33,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:33,645 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-14 14:03:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,691 INFO L93 Difference]: Finished difference Result 213 states and 415 transitions. [2022-07-14 14:03:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:33,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 14:03:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,693 INFO L225 Difference]: With dead ends: 213 [2022-07-14 14:03:33,693 INFO L226 Difference]: Without dead ends: 213 [2022-07-14 14:03:33,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:33,694 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-14 14:03:33,694 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-14 14:03:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-14 14:03:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2022-07-14 14:03:33,698 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-14 14:03:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 397 transitions. [2022-07-14 14:03:33,698 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 397 transitions. Word has length 18 [2022-07-14 14:03:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,699 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 397 transitions. [2022-07-14 14:03:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 397 transitions. [2022-07-14 14:03:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:33,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,699 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 14:03:33,700 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-14 14:03:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1615752332, now seen corresponding path program 1 times [2022-07-14 14:03:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130815802] [2022-07-14 14:03:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:33,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130815802] [2022-07-14 14:03:33,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130815802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:33,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:33,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961990806] [2022-07-14 14:03:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:33,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:33,766 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-14 14:03:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:33,868 INFO L93 Difference]: Finished difference Result 258 states and 522 transitions. [2022-07-14 14:03:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:03:33,868 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-14 14:03:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:33,871 INFO L225 Difference]: With dead ends: 258 [2022-07-14 14:03:33,871 INFO L226 Difference]: Without dead ends: 258 [2022-07-14 14:03:33,871 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-14 14:03:33,873 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 14:03:33,874 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-14 14:03:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-14 14:03:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2022-07-14 14:03:33,879 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-14 14:03:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 496 transitions. [2022-07-14 14:03:33,880 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 496 transitions. Word has length 18 [2022-07-14 14:03:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:33,880 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 496 transitions. [2022-07-14 14:03:33,880 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-14 14:03:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 496 transitions. [2022-07-14 14:03:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 14:03:33,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:33,882 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:33,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 14:03:33,882 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-14 14:03:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1490186839, now seen corresponding path program 1 times [2022-07-14 14:03:33,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:33,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554957948] [2022-07-14 14:03:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:33,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:34,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:34,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554957948] [2022-07-14 14:03:34,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554957948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:34,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:34,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:03:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416919010] [2022-07-14 14:03:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:34,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 14:03:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:03:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:34,018 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-14 14:03:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:34,122 INFO L93 Difference]: Finished difference Result 288 states and 611 transitions. [2022-07-14 14:03:34,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:03:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 14:03:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:34,124 INFO L225 Difference]: With dead ends: 288 [2022-07-14 14:03:34,124 INFO L226 Difference]: Without dead ends: 288 [2022-07-14 14:03:34,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:34,125 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-14 14:03:34,125 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-14 14:03:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-07-14 14:03:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2022-07-14 14:03:34,131 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-14 14:03:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 563 transitions. [2022-07-14 14:03:34,132 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 563 transitions. Word has length 19 [2022-07-14 14:03:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:34,132 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 563 transitions. [2022-07-14 14:03:34,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 563 transitions. [2022-07-14 14:03:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 14:03:34,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:34,133 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:34,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 14:03:34,134 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-14 14:03:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1490185798, now seen corresponding path program 1 times [2022-07-14 14:03:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:34,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436283251] [2022-07-14 14:03:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:34,165 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-14 14:03:34,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:34,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436283251] [2022-07-14 14:03:34,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436283251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:34,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538021509] [2022-07-14 14:03:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:34,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:34,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:34,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:34,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 14:03:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:34,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:03:34,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:34,268 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-14 14:03:34,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:34,285 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-14 14:03:34,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538021509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:34,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:34,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-14 14:03:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227771132] [2022-07-14 14:03:34,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:34,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 14:03:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:34,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:03:34,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:34,288 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-14 14:03:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:34,421 INFO L93 Difference]: Finished difference Result 416 states and 903 transitions. [2022-07-14 14:03:34,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 14:03:34,422 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-14 14:03:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:34,424 INFO L225 Difference]: With dead ends: 416 [2022-07-14 14:03:34,424 INFO L226 Difference]: Without dead ends: 416 [2022-07-14 14:03:34,424 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-14 14:03:34,425 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-14 14:03:34,425 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-14 14:03:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-14 14:03:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 354. [2022-07-14 14:03:34,433 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-14 14:03:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 836 transitions. [2022-07-14 14:03:34,435 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 836 transitions. Word has length 19 [2022-07-14 14:03:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:34,435 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 836 transitions. [2022-07-14 14:03:34,435 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-14 14:03:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 836 transitions. [2022-07-14 14:03:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:34,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:34,436 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:34,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:34,651 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-14 14:03:34,651 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-14 14:03:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1048848633, now seen corresponding path program 1 times [2022-07-14 14:03:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:34,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095650086] [2022-07-14 14:03:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095650086] [2022-07-14 14:03:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095650086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:34,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:34,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205643603] [2022-07-14 14:03:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:34,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:34,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:34,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:34,790 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-14 14:03:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:35,029 INFO L93 Difference]: Finished difference Result 375 states and 860 transitions. [2022-07-14 14:03:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:03:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:35,032 INFO L225 Difference]: With dead ends: 375 [2022-07-14 14:03:35,032 INFO L226 Difference]: Without dead ends: 375 [2022-07-14 14:03:35,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:35,033 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:35,033 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.1s Time] [2022-07-14 14:03:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-14 14:03:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 353. [2022-07-14 14:03:35,042 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-14 14:03:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 831 transitions. [2022-07-14 14:03:35,044 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 831 transitions. Word has length 20 [2022-07-14 14:03:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:35,045 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 831 transitions. [2022-07-14 14:03:35,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 831 transitions. [2022-07-14 14:03:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:35,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:35,046 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:35,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 14:03:35,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1048881928, now seen corresponding path program 1 times [2022-07-14 14:03:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:35,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305598743] [2022-07-14 14:03:35,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:35,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:35,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305598743] [2022-07-14 14:03:35,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305598743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:35,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773709674] [2022-07-14 14:03:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:35,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:35,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:35,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:35,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 14:03:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:35,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:35,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:35,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:35,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:35,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:35,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:03:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:48,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:55,130 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-14 14:03:55,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-14 14:03:55,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773709674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:55,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:55,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:03:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724712852] [2022-07-14 14:03:55,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:55,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:03:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:03:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:03:55,337 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-14 14:03:55,342 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-14 14:03:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:55,937 INFO L93 Difference]: Finished difference Result 370 states and 855 transitions. [2022-07-14 14:03:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:03:55,938 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:03:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:55,940 INFO L225 Difference]: With dead ends: 370 [2022-07-14 14:03:55,940 INFO L226 Difference]: Without dead ends: 370 [2022-07-14 14:03:55,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=94, Invalid=237, Unknown=19, NotChecked=70, Total=420 [2022-07-14 14:03:55,941 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-14 14:03:55,941 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-14 14:03:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-14 14:03:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 358. [2022-07-14 14:03:55,949 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-14 14:03:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 841 transitions. [2022-07-14 14:03:55,950 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 841 transitions. Word has length 20 [2022-07-14 14:03:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:55,951 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 841 transitions. [2022-07-14 14:03:55,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 841 transitions. [2022-07-14 14:03:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:55,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:55,956 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:55,985 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-14 14:03:56,181 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-14 14:03:56,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1110038852, now seen corresponding path program 1 times [2022-07-14 14:03:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:56,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118458040] [2022-07-14 14:03:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118458040] [2022-07-14 14:03:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118458040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:56,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:56,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186023299] [2022-07-14 14:03:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:56,340 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-14 14:03:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:56,498 INFO L93 Difference]: Finished difference Result 383 states and 882 transitions. [2022-07-14 14:03:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 14:03:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:03:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:56,501 INFO L225 Difference]: With dead ends: 383 [2022-07-14 14:03:56,501 INFO L226 Difference]: Without dead ends: 383 [2022-07-14 14:03:56,501 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-14 14:03:56,501 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-14 14:03:56,502 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-14 14:03:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-14 14:03:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2022-07-14 14:03:56,509 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-14 14:03:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 857 transitions. [2022-07-14 14:03:56,511 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 857 transitions. Word has length 20 [2022-07-14 14:03:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:56,511 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 857 transitions. [2022-07-14 14:03:56,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 857 transitions. [2022-07-14 14:03:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:56,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:56,512 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:56,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 14:03:56,512 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-14 14:03:56,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash 399523502, now seen corresponding path program 2 times [2022-07-14 14:03:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:56,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899957355] [2022-07-14 14:03:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899957355] [2022-07-14 14:03:56,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899957355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:56,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:56,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173964486] [2022-07-14 14:03:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:56,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:56,630 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-14 14:03:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:56,829 INFO L93 Difference]: Finished difference Result 391 states and 898 transitions. [2022-07-14 14:03:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:03:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:03:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:56,832 INFO L225 Difference]: With dead ends: 391 [2022-07-14 14:03:56,832 INFO L226 Difference]: Without dead ends: 391 [2022-07-14 14:03:56,832 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-14 14:03:56,833 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:56,833 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.1s Time] [2022-07-14 14:03:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-14 14:03:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 365. [2022-07-14 14:03:56,866 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-14 14:03:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 855 transitions. [2022-07-14 14:03:56,868 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 855 transitions. Word has length 20 [2022-07-14 14:03:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:56,868 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 855 transitions. [2022-07-14 14:03:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 855 transitions. [2022-07-14 14:03:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:56,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:56,870 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:56,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 14:03:56,871 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-14 14:03:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 396981812, now seen corresponding path program 3 times [2022-07-14 14:03:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:56,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327623978] [2022-07-14 14:03:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:56,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327623978] [2022-07-14 14:03:56,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327623978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:56,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:56,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182284379] [2022-07-14 14:03:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:56,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:56,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:56,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:56,992 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-14 14:03:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:57,237 INFO L93 Difference]: Finished difference Result 380 states and 873 transitions. [2022-07-14 14:03:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:57,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:03:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:57,239 INFO L225 Difference]: With dead ends: 380 [2022-07-14 14:03:57,239 INFO L226 Difference]: Without dead ends: 380 [2022-07-14 14:03:57,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-07-14 14:03:57,240 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-14 14:03:57,240 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-14 14:03:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-14 14:03:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 360. [2022-07-14 14:03:57,247 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-14 14:03:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 843 transitions. [2022-07-14 14:03:57,248 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 843 transitions. Word has length 20 [2022-07-14 14:03:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:57,249 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 843 transitions. [2022-07-14 14:03:57,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 843 transitions. [2022-07-14 14:03:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:57,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:57,250 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:57,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 14:03:57,250 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:03:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2040146309, now seen corresponding path program 1 times [2022-07-14 14:03:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:57,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466206745] [2022-07-14 14:03:57,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:03:57,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:57,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466206745] [2022-07-14 14:03:57,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466206745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:57,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117864002] [2022-07-14 14:03:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:57,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:57,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:57,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:03:57,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 14:03:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:57,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:57,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:57,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:57,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:57,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:04:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:10,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:17,880 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-14 14:04:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:18,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117864002] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:18,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:18,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-07-14 14:04:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518316346] [2022-07-14 14:04:18,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:18,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 14:04:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 14:04:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=241, Unknown=20, NotChecked=34, Total=380 [2022-07-14 14:04:18,051 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-14 14:04:18,061 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-14 14:04:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:31,317 INFO L93 Difference]: Finished difference Result 386 states and 884 transitions. [2022-07-14 14:04:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:04:31,318 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-14 14:04:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:31,319 INFO L225 Difference]: With dead ends: 386 [2022-07-14 14:04:31,319 INFO L226 Difference]: Without dead ends: 386 [2022-07-14 14:04:31,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=126, Invalid=361, Unknown=27, NotChecked=86, Total=600 [2022-07-14 14:04:31,320 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-14 14:04:31,320 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-14 14:04:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-14 14:04:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 365. [2022-07-14 14:04:31,327 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-14 14:04:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 856 transitions. [2022-07-14 14:04:31,329 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 856 transitions. Word has length 20 [2022-07-14 14:04:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:31,329 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 856 transitions. [2022-07-14 14:04:31,329 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-14 14:04:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 856 transitions. [2022-07-14 14:04:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:04:31,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:31,331 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:31,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:04:31,554 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-14 14:04:31,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:04:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1844398523, now seen corresponding path program 1 times [2022-07-14 14:04:31,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:31,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930658941] [2022-07-14 14:04:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:31,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930658941] [2022-07-14 14:04:31,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930658941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:31,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116372959] [2022-07-14 14:04:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:31,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:31,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:31,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:31,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 14:04:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:31,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:31,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:31,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:04:31,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:31,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:31,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:04:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:45,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:52,506 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-14 14:04:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:52,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116372959] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:52,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:52,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669400421] [2022-07-14 14:04:52,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:52,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:52,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:04:52,678 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-14 14:04:52,691 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-14 14:04:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:53,271 INFO L93 Difference]: Finished difference Result 395 states and 907 transitions. [2022-07-14 14:04:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:04:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 14:04:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:53,274 INFO L225 Difference]: With dead ends: 395 [2022-07-14 14:04:53,274 INFO L226 Difference]: Without dead ends: 395 [2022-07-14 14:04:53,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-14 14:04:53,275 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-14 14:04:53,276 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-14 14:04:53,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-07-14 14:04:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 365. [2022-07-14 14:04:53,283 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-14 14:04:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 856 transitions. [2022-07-14 14:04:53,284 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 856 transitions. Word has length 21 [2022-07-14 14:04:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:53,285 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 856 transitions. [2022-07-14 14:04:53,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:04:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 856 transitions. [2022-07-14 14:04:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:04:53,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:53,285 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:53,311 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-14 14:04:53,505 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-14 14:04:53,506 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-14 14:04:53,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1844422703, now seen corresponding path program 2 times [2022-07-14 14:04:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:53,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175510871] [2022-07-14 14:04:53,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:53,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:53,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175510871] [2022-07-14 14:04:53,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175510871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:53,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597824045] [2022-07-14 14:04:53,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:04:53,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:53,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:53,630 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:53,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 14:04:53,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:04:53,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:04:53,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:53,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:53,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:04:53,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:53,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:53,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:05:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:08,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:17,085 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-14 14:05:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:17,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597824045] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:17,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:17,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:17,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103311741] [2022-07-14 14:05:17,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:17,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:17,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:17,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:05:17,244 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-14 14:05:17,251 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-14 14:05:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:18,192 INFO L93 Difference]: Finished difference Result 376 states and 869 transitions. [2022-07-14 14:05:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:05:18,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 14:05:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:18,194 INFO L225 Difference]: With dead ends: 376 [2022-07-14 14:05:18,194 INFO L226 Difference]: Without dead ends: 376 [2022-07-14 14:05:18,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-14 14:05:18,195 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-14 14:05:18,195 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-14 14:05:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-14 14:05:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2022-07-14 14:05:18,203 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-14 14:05:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 854 transitions. [2022-07-14 14:05:18,204 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 854 transitions. Word has length 21 [2022-07-14 14:05:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:18,205 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 854 transitions. [2022-07-14 14:05:18,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:05:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 854 transitions. [2022-07-14 14:05:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:05:18,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:18,206 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:18,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 14:05:18,419 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-14 14:05:18,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:05:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1179973937, now seen corresponding path program 1 times [2022-07-14 14:05:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:18,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469376578] [2022-07-14 14:05:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469376578] [2022-07-14 14:05:18,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469376578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994930014] [2022-07-14 14:05:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:18,559 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:05:18,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 14:05:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:18,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:18,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:18,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:05:18,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:18,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:05:18,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:05:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:30,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:37,847 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-14 14:05:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:37,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994930014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:37,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:37,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:37,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433210267] [2022-07-14 14:05:37,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:37,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:37,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:37,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:05:37,986 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-14 14:05:37,990 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-14 14:05:44,533 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-14 14:05:45,091 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-14 14:05:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:51,680 INFO L93 Difference]: Finished difference Result 376 states and 880 transitions. [2022-07-14 14:05:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 14:05:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 14:05:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:51,683 INFO L225 Difference]: With dead ends: 376 [2022-07-14 14:05:51,683 INFO L226 Difference]: Without dead ends: 376 [2022-07-14 14:05:51,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=120, Invalid=324, Unknown=34, NotChecked=172, Total=650 [2022-07-14 14:05:51,684 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-14 14:05:51,684 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-14 14:05:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-14 14:05:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 364. [2022-07-14 14:05:51,709 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-14 14:05:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 854 transitions. [2022-07-14 14:05:51,710 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 854 transitions. Word has length 21 [2022-07-14 14:05:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:51,712 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 854 transitions. [2022-07-14 14:05:51,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:05:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 854 transitions. [2022-07-14 14:05:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:05:51,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:51,713 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:51,738 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-14 14:05:51,935 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-14 14:05:51,936 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-14 14:05:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1179938597, now seen corresponding path program 2 times [2022-07-14 14:05:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:51,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88980493] [2022-07-14 14:05:51,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:05:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88980493] [2022-07-14 14:05:52,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88980493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:52,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768263452] [2022-07-14 14:05:52,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:05:52,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:52,086 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:05:52,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 14:05:52,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:05:52,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:05:52,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:52,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:52,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:05:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:52,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:05:52,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:06:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:09,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:17,878 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-14 14:06:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:18,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768263452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:18,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:18,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-07-14 14:06:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093825977] [2022-07-14 14:06:18,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 14:06:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 14:06:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=241, Unknown=21, NotChecked=34, Total=380 [2022-07-14 14:06:18,033 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-14 14:06:18,041 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-14 14:06:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:34,410 INFO L93 Difference]: Finished difference Result 373 states and 875 transitions. [2022-07-14 14:06:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:06:34,410 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-14 14:06:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:34,411 INFO L225 Difference]: With dead ends: 373 [2022-07-14 14:06:34,412 INFO L226 Difference]: Without dead ends: 373 [2022-07-14 14:06:34,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=125, Invalid=361, Unknown=28, NotChecked=86, Total=600 [2022-07-14 14:06:34,413 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 14:06:34,413 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-14 14:06:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-14 14:06:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2022-07-14 14:06:34,428 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-14 14:06:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 847 transitions. [2022-07-14 14:06:34,430 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 847 transitions. Word has length 21 [2022-07-14 14:06:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:34,430 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 847 transitions. [2022-07-14 14:06:34,430 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-14 14:06:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 847 transitions. [2022-07-14 14:06:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:34,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:34,431 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:34,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:34,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 14:06:34,647 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2022-07-14 14:06:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:34,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1373798041, now seen corresponding path program 1 times [2022-07-14 14:06:34,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:34,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172790950] [2022-07-14 14:06:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172790950] [2022-07-14 14:06:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172790950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847203225] [2022-07-14 14:06:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:34,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:34,771 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:06:34,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 14:06:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:06:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:34,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:06:34,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:34,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:06:35,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:06:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:45,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:52,200 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-14 14:06:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:52,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847203225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:52,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:52,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:06:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199146632] [2022-07-14 14:06:52,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:52,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:06:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:06:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=207, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:06:52,341 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-14 14:06:52,347 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-14 14:06:53,054 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-14 14:06:54,930 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-14 14:06:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:57,024 INFO L93 Difference]: Finished difference Result 386 states and 887 transitions. [2022-07-14 14:06:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 14:06:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 14:06:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:57,026 INFO L225 Difference]: With dead ends: 386 [2022-07-14 14:06:57,026 INFO L226 Difference]: Without dead ends: 386 [2022-07-14 14:06:57,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=113, Invalid=301, Unknown=22, NotChecked=164, Total=600 [2022-07-14 14:06:57,027 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:57,027 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.1s Time] [2022-07-14 14:06:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-14 14:06:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 363. [2022-07-14 14:06:57,034 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-14 14:06:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 851 transitions. [2022-07-14 14:06:57,035 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 851 transitions. Word has length 22 [2022-07-14 14:06:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:57,036 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 851 transitions. [2022-07-14 14:06:57,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:06:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 851 transitions. [2022-07-14 14:06:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:57,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:57,037 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:57,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:57,262 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-14 14:06:57,262 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-14 14:06:57,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1341841871, now seen corresponding path program 1 times [2022-07-14 14:06:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:57,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158025958] [2022-07-14 14:06:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158025958] [2022-07-14 14:06:57,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158025958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:06:57,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:06:57,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:06:57,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590176593] [2022-07-14 14:06:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:06:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:06:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:57,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:06:57,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:57,313 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-14 14:06:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:57,363 INFO L93 Difference]: Finished difference Result 350 states and 797 transitions. [2022-07-14 14:06:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:06:57,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 14:06:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:57,365 INFO L225 Difference]: With dead ends: 350 [2022-07-14 14:06:57,365 INFO L226 Difference]: Without dead ends: 350 [2022-07-14 14:06:57,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:06:57,367 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-14 14:06:57,367 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-14 14:06:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-14 14:06:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-07-14 14:06:57,373 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-14 14:06:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 797 transitions. [2022-07-14 14:06:57,375 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 797 transitions. Word has length 22 [2022-07-14 14:06:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:57,375 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 797 transitions. [2022-07-14 14:06:57,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:06:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 797 transitions. [2022-07-14 14:06:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:06:57,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:57,376 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:57,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 14:06:57,376 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-14 14:06:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1342517491, now seen corresponding path program 2 times [2022-07-14 14:06:57,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:57,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672382663] [2022-07-14 14:06:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:06:57,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:57,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672382663] [2022-07-14 14:06:57,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672382663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:57,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127958410] [2022-07-14 14:06:57,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:06:57,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:57,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:57,524 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:06:57,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 14:06:57,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:06:57,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:06:57,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 14:06:57,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:57,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:06:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:57,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:06:57,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:07:03,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-14 14:07:03,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:21,472 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-14 14:07:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127958410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:21,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:21,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 20 [2022-07-14 14:07:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721907178] [2022-07-14 14:07:21,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:21,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 14:07:21,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 14:07:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=293, Unknown=24, NotChecked=38, Total=462 [2022-07-14 14:07:21,596 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-14 14:07:21,604 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-14 14:07:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:23,530 INFO L93 Difference]: Finished difference Result 366 states and 819 transitions. [2022-07-14 14:07:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:07:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 14:07:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:23,532 INFO L225 Difference]: With dead ends: 366 [2022-07-14 14:07:23,532 INFO L226 Difference]: Without dead ends: 366 [2022-07-14 14:07:23,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=126, Invalid=363, Unknown=25, NotChecked=86, Total=600 [2022-07-14 14:07:23,533 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-14 14:07:23,533 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-14 14:07:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-07-14 14:07:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 341. [2022-07-14 14:07:23,539 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-14 14:07:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 778 transitions. [2022-07-14 14:07:23,540 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 778 transitions. Word has length 22 [2022-07-14 14:07:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:23,540 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 778 transitions. [2022-07-14 14:07:23,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 778 transitions. [2022-07-14 14:07:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:23,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:23,541 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:23,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 14:07:23,759 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-14 14:07:23,760 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-14 14:07:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash -752290858, now seen corresponding path program 1 times [2022-07-14 14:07:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:23,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104196213] [2022-07-14 14:07:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104196213] [2022-07-14 14:07:23,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104196213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:23,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917912306] [2022-07-14 14:07:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:23,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:23,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:23,884 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:07:23,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 14:07:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:24,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:07:24,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:24,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:07:24,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:24,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:07:24,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:07:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:37,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:45,844 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-14 14:07:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:45,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917912306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:45,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:07:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141279784] [2022-07-14 14:07:45,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:45,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:07:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:07:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:07:45,966 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-14 14:07:45,973 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-14 14:07:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:49,297 INFO L93 Difference]: Finished difference Result 377 states and 840 transitions. [2022-07-14 14:07:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 14:07:49,298 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 14:07:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:49,300 INFO L225 Difference]: With dead ends: 377 [2022-07-14 14:07:49,300 INFO L226 Difference]: Without dead ends: 377 [2022-07-14 14:07:49,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=101, Invalid=267, Unknown=20, NotChecked=74, Total=462 [2022-07-14 14:07:49,301 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-14 14:07:49,301 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-14 14:07:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-14 14:07:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 343. [2022-07-14 14:07:49,307 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-14 14:07:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 783 transitions. [2022-07-14 14:07:49,308 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 783 transitions. Word has length 22 [2022-07-14 14:07:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:49,309 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 783 transitions. [2022-07-14 14:07:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 783 transitions. [2022-07-14 14:07:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:49,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:49,309 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:49,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 14:07:49,527 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-14 14:07:49,528 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-14 14:07:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -752301088, now seen corresponding path program 2 times [2022-07-14 14:07:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077183726] [2022-07-14 14:07:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:49,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:49,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077183726] [2022-07-14 14:07:49,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077183726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:49,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607342263] [2022-07-14 14:07:49,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:07:49,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:49,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:49,663 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:07:49,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 14:07:49,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:07:49,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:07:49,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-14 14:07:49,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:49,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:07:49,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:49,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:07:49,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-14 14:07:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:07:55,141 INFO L328 TraceCheckSpWp]: Computing backward predicates...