./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.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_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:03:23,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:03:23,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:03:23,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:03:23,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:03:23,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:03:23,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:03:23,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:03:23,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:03:23,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:03:23,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:03:23,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:03:23,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:03:23,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:03:23,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:03:23,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:03:23,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:03:23,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:03:23,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:03:23,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:03:23,733 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:03:23,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:03:23,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:03:23,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:03:23,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:03:23,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:03:23,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:03:23,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:03:23,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:03:23,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:03:23,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:03:23,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:03:23,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:03:23,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:03:23,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:03:23,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:03:23,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:03:23,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:03:23,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:03:23,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:03:23,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:03:23,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:03:23,749 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:23,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:03:23,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:03:23,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:03:23,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:03:23,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 14:03:23,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 14:03:23,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:03:23,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:03:23,774 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:03:23,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:03:23,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 14:03:23,775 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:03:23,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 14:03:23,776 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 14:03:23,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:03:23,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 14:03:23,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:23,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:03:23,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 14:03:23,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 14:03:23,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:03:23,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 14:03:23,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 14:03:23,780 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2022-07-14 14:03:23,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:03:24,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:03:24,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:03:24,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:03:24,009 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:03:24,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-07-14 14:03:24,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d1a1fcb/d6039e23b52e46c2b81985e88caf0a9a/FLAG0eade9c41 [2022-07-14 14:03:24,531 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:03:24,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2022-07-14 14:03:24,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d1a1fcb/d6039e23b52e46c2b81985e88caf0a9a/FLAG0eade9c41 [2022-07-14 14:03:25,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84d1a1fcb/d6039e23b52e46c2b81985e88caf0a9a [2022-07-14 14:03:25,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:03:25,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:03:25,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:25,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:03:25,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:03:25,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:25" (1/1) ... [2022-07-14 14:03:25,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c78301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:25, skipping insertion in model container [2022-07-14 14:03:25,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:03:25" (1/1) ... [2022-07-14 14:03:25,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:03:25,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:03:25,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:25,375 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:03:25,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:03:25,437 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:03:25,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:25 WrapperNode [2022-07-14 14:03:25,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:03:25,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:25,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:03:25,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:03:25,447 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:25" (1/1) ... [2022-07-14 14:03:25,477 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:25" (1/1) ... [2022-07-14 14:03:25,502 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-14 14:03:25,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:03:25,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:03:25,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:03:25,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:03:25,511 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:25" (1/1) ... [2022-07-14 14:03:25,511 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:25" (1/1) ... [2022-07-14 14:03:25,524 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:25" (1/1) ... [2022-07-14 14:03:25,524 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:25" (1/1) ... [2022-07-14 14:03:25,531 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:25" (1/1) ... [2022-07-14 14:03:25,534 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:25" (1/1) ... [2022-07-14 14:03:25,535 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:25" (1/1) ... [2022-07-14 14:03:25,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:03:25,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:03:25,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:03:25,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:03:25,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:25" (1/1) ... [2022-07-14 14:03:25,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 14:03:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:25,586 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:25,651 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:25,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 14:03:25,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 14:03:25,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 14:03:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 14:03:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-14 14:03:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 14:03:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-14 14:03:25,708 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-14 14:03:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:03:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:03:25,710 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:25,851 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:03:25,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:03:25,983 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:03:25,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:03:25,988 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 14:03:25,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:25 BoogieIcfgContainer [2022-07-14 14:03:25,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:03:25,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 14:03:25,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 14:03:25,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 14:03:25,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 02:03:25" (1/3) ... [2022-07-14 14:03:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edf25be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:25, skipping insertion in model container [2022-07-14 14:03:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:03:25" (2/3) ... [2022-07-14 14:03:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edf25be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 02:03:25, skipping insertion in model container [2022-07-14 14:03:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:03:25" (3/3) ... [2022-07-14 14:03:25,995 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2022-07-14 14:03:25,998 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-14 14:03:26,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 14:03:26,005 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-07-14 14:03:26,005 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-14 14:03:26,036 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-14 14:03:26,056 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-14 14:03:26,066 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 98 transitions, 201 flow [2022-07-14 14:03:26,068 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 98 transitions, 201 flow [2022-07-14 14:03:26,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 201 flow [2022-07-14 14:03:26,092 INFO L129 PetriNetUnfolder]: 6/97 cut-off events. [2022-07-14 14:03:26,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-14 14:03:26,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 6/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 144 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-07-14 14:03:26,098 INFO L116 LiptonReduction]: Number of co-enabled transitions 2304 [2022-07-14 14:03:27,760 INFO L131 LiptonReduction]: Checked pairs total: 2843 [2022-07-14 14:03:27,760 INFO L133 LiptonReduction]: Total number of compositions: 93 [2022-07-14 14:03:27,765 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 27 transitions, 59 flow [2022-07-14 14:03:27,792 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:27,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 14:03:27,809 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@73c41fb6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17d92a3a [2022-07-14 14:03:27,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-07-14 14:03:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-14 14:03:27,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:27,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-14 14:03:27,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:27,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash 12029, now seen corresponding path program 1 times [2022-07-14 14:03:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331586124] [2022-07-14 14:03:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:27,904 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:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331586124] [2022-07-14 14:03:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331586124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:27,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 14:03:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25246417] [2022-07-14 14:03:27,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 14:03:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 14:03:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:03:27,925 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 2.6153846153846154) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:27,964 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions. [2022-07-14 14:03:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 14:03:27,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-07-14 14:03:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:27,973 INFO L225 Difference]: With dead ends: 103 [2022-07-14 14:03:27,973 INFO L226 Difference]: Without dead ends: 103 [2022-07-14 14:03:27,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 14:03:27,975 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:27,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-14 14:03:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-14 14:03:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 2.6025641025641026) internal successors, (203), 102 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 203 transitions. [2022-07-14 14:03:28,003 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 203 transitions. Word has length 2 [2022-07-14 14:03:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:28,003 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 203 transitions. [2022-07-14 14:03:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 203 transitions. [2022-07-14 14:03:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-07-14 14:03:28,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:28,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-07-14 14:03:28,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 14:03:28,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash 12051, now seen corresponding path program 1 times [2022-07-14 14:03:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:28,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877697929] [2022-07-14 14:03:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:28,055 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:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:28,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877697929] [2022-07-14 14:03:28,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877697929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:28,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:28,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 14:03:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49362388] [2022-07-14 14:03:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:28,058 INFO L87 Difference]: Start difference. First operand 103 states and 203 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:28,095 INFO L93 Difference]: Finished difference Result 104 states and 204 transitions. [2022-07-14 14:03:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:28,096 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:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:28,098 INFO L225 Difference]: With dead ends: 104 [2022-07-14 14:03:28,098 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 14:03:28,098 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:28,099 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:28,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 14:03:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-14 14:03:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 2.5822784810126582) internal successors, (204), 103 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 204 transitions. [2022-07-14 14:03:28,106 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 204 transitions. Word has length 2 [2022-07-14 14:03:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:28,107 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 204 transitions. [2022-07-14 14:03:28,107 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:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 204 transitions. [2022-07-14 14:03:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 14:03:28,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:28,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 14:03:28,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 14:03:28,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash 373883, now seen corresponding path program 1 times [2022-07-14 14:03:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864552392] [2022-07-14 14:03:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:03:28,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864552392] [2022-07-14 14:03:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864552392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:28,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:28,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126260791] [2022-07-14 14:03:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:28,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:28,131 INFO L87 Difference]: Start difference. First operand 104 states and 204 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:28,154 INFO L93 Difference]: Finished difference Result 103 states and 203 transitions. [2022-07-14 14:03:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:28,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 14:03:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:28,156 INFO L225 Difference]: With dead ends: 103 [2022-07-14 14:03:28,156 INFO L226 Difference]: Without dead ends: 103 [2022-07-14 14:03:28,157 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:28,157 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:28,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-14 14:03:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-14 14:03:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 2.569620253164557) internal successors, (203), 102 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 203 transitions. [2022-07-14 14:03:28,164 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 203 transitions. Word has length 3 [2022-07-14 14:03:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:28,164 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 203 transitions. [2022-07-14 14:03:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 203 transitions. [2022-07-14 14:03:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 14:03:28,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:28,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:03:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 14:03:28,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1745789244, now seen corresponding path program 1 times [2022-07-14 14:03:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921408798] [2022-07-14 14:03:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:28,209 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:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:28,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921408798] [2022-07-14 14:03:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921408798] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694512369] [2022-07-14 14:03:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:28,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:28,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:28,222 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:28,288 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:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:28,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:03:28,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:28,357 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:28,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:28,379 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:28,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694512369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:28,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:28,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-14 14:03:28,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097242689] [2022-07-14 14:03:28,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:28,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 14:03:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:28,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 14:03:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:28,381 INFO L87 Difference]: Start difference. First operand 103 states and 203 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:28,434 INFO L93 Difference]: Finished difference Result 106 states and 206 transitions. [2022-07-14 14:03:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:03:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 14:03:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:28,438 INFO L225 Difference]: With dead ends: 106 [2022-07-14 14:03:28,438 INFO L226 Difference]: Without dead ends: 106 [2022-07-14 14:03:28,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 14:03:28,438 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:28,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-14 14:03:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-14 14:03:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 2.5121951219512195) internal successors, (206), 105 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 206 transitions. [2022-07-14 14:03:28,443 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 206 transitions. Word has length 6 [2022-07-14 14:03:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:28,443 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 206 transitions. [2022-07-14 14:03:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 206 transitions. [2022-07-14 14:03:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 14:03:28,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:28,444 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-14 14:03:28,463 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:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:28,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1994824916, now seen corresponding path program 2 times [2022-07-14 14:03:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:28,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683831799] [2022-07-14 14:03:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:28,706 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:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:28,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683831799] [2022-07-14 14:03:28,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683831799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:28,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336428849] [2022-07-14 14:03:28,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:03:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:28,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:28,709 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:28,710 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:28,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 14:03:28,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:03:28,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 14:03:28,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:28,818 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:28,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:28,891 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:28,910 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:28,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 14:03:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336428849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:28,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 14:03:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2022-07-14 14:03:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586059949] [2022-07-14 14:03:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 14:03:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:03:28,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:03:28,912 INFO L87 Difference]: Start difference. First operand 106 states and 206 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:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:28,971 INFO L93 Difference]: Finished difference Result 146 states and 286 transitions. [2022-07-14 14:03:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:28,972 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:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:28,973 INFO L225 Difference]: With dead ends: 146 [2022-07-14 14:03:28,974 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 14:03:28,974 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:28,975 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:28,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 14:03:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2022-07-14 14:03:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 2.5052631578947366) internal successors, (238), 118 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 238 transitions. [2022-07-14 14:03:28,992 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 238 transitions. Word has length 9 [2022-07-14 14:03:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:28,993 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 238 transitions. [2022-07-14 14:03:28,993 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:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 238 transitions. [2022-07-14 14:03:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 14:03:28,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:28,993 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:29,011 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:29,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:29,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1710030101, now seen corresponding path program 1 times [2022-07-14 14:03:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111350361] [2022-07-14 14:03:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,253 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:29,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111350361] [2022-07-14 14:03:29,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111350361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:29,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061848300] [2022-07-14 14:03:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:29,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:29,255 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:29,256 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:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:03:29,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:29,328 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:29,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:29,394 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:29,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061848300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:29,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:29,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-14 14:03:29,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700388125] [2022-07-14 14:03:29,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 14:03:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 14:03:29,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:03:29,397 INFO L87 Difference]: Start difference. First operand 119 states and 238 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:29,449 INFO L93 Difference]: Finished difference Result 125 states and 244 transitions. [2022-07-14 14:03:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:03:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 14:03:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:29,450 INFO L225 Difference]: With dead ends: 125 [2022-07-14 14:03:29,450 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 14:03:29,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 14:03:29,452 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:29,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 14:03:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-14 14:03:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 2.4158415841584158) internal successors, (244), 124 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 244 transitions. [2022-07-14 14:03:29,470 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 244 transitions. Word has length 10 [2022-07-14 14:03:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:29,470 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 244 transitions. [2022-07-14 14:03:29,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 244 transitions. [2022-07-14 14:03:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:29,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,471 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:29,487 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:29,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:29,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1621603861, now seen corresponding path program 2 times [2022-07-14 14:03:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142851419] [2022-07-14 14:03:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,766 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:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142851419] [2022-07-14 14:03:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142851419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:29,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886701660] [2022-07-14 14:03:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:29,770 INFO L87 Difference]: Start difference. First operand 125 states and 244 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:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:29,832 INFO L93 Difference]: Finished difference Result 145 states and 278 transitions. [2022-07-14 14:03:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:29,836 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:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:29,837 INFO L225 Difference]: With dead ends: 145 [2022-07-14 14:03:29,837 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 14:03:29,837 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:29,838 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:29,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 14:03:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2022-07-14 14:03:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.388888888888889) internal successors, (258), 131 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:03:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 258 transitions. [2022-07-14 14:03:29,846 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 258 transitions. Word has length 16 [2022-07-14 14:03:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:29,846 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 258 transitions. [2022-07-14 14:03:29,846 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:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 258 transitions. [2022-07-14 14:03:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 14:03:29,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:29,848 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:29,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 14:03:29,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:29,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1621594451, now seen corresponding path program 1 times [2022-07-14 14:03:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:29,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437027831] [2022-07-14 14:03:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:29,939 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:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437027831] [2022-07-14 14:03:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437027831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:29,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:29,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:03:29,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384903351] [2022-07-14 14:03:29,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:29,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 14:03:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:29,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 14:03:29,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 14:03:29,941 INFO L87 Difference]: Start difference. First operand 132 states and 258 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:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,004 INFO L93 Difference]: Finished difference Result 135 states and 258 transitions. [2022-07-14 14:03:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:03:30,005 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:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,006 INFO L225 Difference]: With dead ends: 135 [2022-07-14 14:03:30,006 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 14:03:30,007 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:30,008 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 14:03:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-14 14:03:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 108 states have (on average 2.3518518518518516) internal successors, (254), 131 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 254 transitions. [2022-07-14 14:03:30,013 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 254 transitions. Word has length 16 [2022-07-14 14:03:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,013 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 254 transitions. [2022-07-14 14:03:30,013 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:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 254 transitions. [2022-07-14 14:03:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:30,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,014 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:30,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 14:03:30,015 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:30,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash 711829442, now seen corresponding path program 1 times [2022-07-14 14:03:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912565864] [2022-07-14 14:03:30,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,052 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:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912565864] [2022-07-14 14:03:30,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912565864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:30,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:30,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117759201] [2022-07-14 14:03:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:30,054 INFO L87 Difference]: Start difference. First operand 132 states and 254 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:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,086 INFO L93 Difference]: Finished difference Result 184 states and 357 transitions. [2022-07-14 14:03:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:30,086 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:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,087 INFO L225 Difference]: With dead ends: 184 [2022-07-14 14:03:30,087 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 14:03:30,087 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:30,088 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 14:03:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2022-07-14 14:03:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 2.387323943661972) internal successors, (339), 165 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 339 transitions. [2022-07-14 14:03:30,119 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 339 transitions. Word has length 18 [2022-07-14 14:03:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,119 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 339 transitions. [2022-07-14 14:03:30,119 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:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 339 transitions. [2022-07-14 14:03:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 14:03:30,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,120 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:30,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 14:03:30,120 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash 720871045, now seen corresponding path program 1 times [2022-07-14 14:03:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820257221] [2022-07-14 14:03:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,169 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:30,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820257221] [2022-07-14 14:03:30,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820257221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:30,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:30,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:03:30,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110141399] [2022-07-14 14:03:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:30,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:03:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:30,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:03:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:03:30,172 INFO L87 Difference]: Start difference. First operand 166 states and 339 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:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:30,205 INFO L93 Difference]: Finished difference Result 228 states and 464 transitions. [2022-07-14 14:03:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:03:30,205 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:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:30,206 INFO L225 Difference]: With dead ends: 228 [2022-07-14 14:03:30,207 INFO L226 Difference]: Without dead ends: 228 [2022-07-14 14:03:30,207 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:30,207 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:30,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:03:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-14 14:03:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 208. [2022-07-14 14:03:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 2.4130434782608696) internal successors, (444), 207 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 444 transitions. [2022-07-14 14:03:30,212 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 444 transitions. Word has length 18 [2022-07-14 14:03:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:30,212 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 444 transitions. [2022-07-14 14:03:30,212 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:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 444 transitions. [2022-07-14 14:03:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 14:03:30,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:30,213 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 14:03:30,213 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:30,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 591876604, now seen corresponding path program 1 times [2022-07-14 14:03:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:30,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898763211] [2022-07-14 14:03:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,311 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:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898763211] [2022-07-14 14:03:30,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898763211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775105956] [2022-07-14 14:03:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:30,313 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:30,314 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:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:30,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:30,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-14 14:03:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:30,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:03:30,480 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:41,750 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:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:03:47,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| Int) (|v_ULTIMATE.start_main_~i~2#1_116| Int) (v_ArrVal_274 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_32| Int) (v_ArrVal_273 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_116|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_32| v_ArrVal_273) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| v_ArrVal_274) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|))) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|) (+ (* |v_ULTIMATE.start_main_~i~2#1_116| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_32|)))) is different from false [2022-07-14 14:03:47,257 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:47,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775105956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:03:47,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:03:47,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-07-14 14:03:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306494588] [2022-07-14 14:03:47,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:03:47,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 14:03:47,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:47,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 14:03:47,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=145, Unknown=17, NotChecked=28, Total=272 [2022-07-14 14:03:47,259 INFO L87 Difference]: Start difference. First operand 208 states and 444 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:47,264 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| Int) (|v_ULTIMATE.start_main_~i~2#1_116| Int) (v_ArrVal_274 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_32| Int) (v_ArrVal_273 (Array Int Int)) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_116|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_32| v_ArrVal_273) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152| v_ArrVal_274) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|))) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_151|) (+ (* |v_ULTIMATE.start_main_~i~2#1_116| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_152|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_32|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:03:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:56,490 INFO L93 Difference]: Finished difference Result 270 states and 628 transitions. [2022-07-14 14:03:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:03:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 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:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:56,492 INFO L225 Difference]: With dead ends: 270 [2022-07-14 14:03:56,492 INFO L226 Difference]: Without dead ends: 270 [2022-07-14 14:03:56,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=125, Invalid=240, Unknown=23, NotChecked=74, Total=462 [2022-07-14 14:03:56,493 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:56,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-07-14 14:03:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-14 14:03:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 240. [2022-07-14 14:03:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 216 states have (on average 2.4814814814814814) internal successors, (536), 239 states have internal predecessors, (536), 0 states have call successors, (0), 0 states 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 536 transitions. [2022-07-14 14:03:56,498 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 536 transitions. Word has length 19 [2022-07-14 14:03:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:56,498 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 536 transitions. [2022-07-14 14:03:56,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 L276 IsEmpty]: Start isEmpty. Operand 240 states and 536 transitions. [2022-07-14 14:03:56,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 14:03:56,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:56,499 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:56,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:03:56,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:56,715 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash 564196735, now seen corresponding path program 1 times [2022-07-14 14:03:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:56,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28066391] [2022-07-14 14:03:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:56,815 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,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28066391] [2022-07-14 14:03:56,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28066391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:56,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:56,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:03:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038074464] [2022-07-14 14:03:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:56,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 14:03:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:03:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:03:56,819 INFO L87 Difference]: Start difference. First operand 240 states and 536 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:56,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:56,905 INFO L93 Difference]: Finished difference Result 271 states and 596 transitions. [2022-07-14 14:03:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 14:03:56,905 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:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:56,906 INFO L225 Difference]: With dead ends: 271 [2022-07-14 14:03:56,906 INFO L226 Difference]: Without dead ends: 271 [2022-07-14 14:03:56,907 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:56,907 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:56,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:56,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-14 14:03:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2022-07-14 14:03:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 2.4517543859649122) internal successors, (559), 251 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 559 transitions. [2022-07-14 14:03:56,912 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 559 transitions. Word has length 19 [2022-07-14 14:03:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:56,912 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 559 transitions. [2022-07-14 14:03:56,912 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:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 559 transitions. [2022-07-14 14:03:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:56,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:56,913 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:56,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 14:03:56,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:56,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1168272817, now seen corresponding path program 1 times [2022-07-14 14:03:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:56,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315295579] [2022-07-14 14:03:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:56,991 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,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315295579] [2022-07-14 14:03:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315295579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569508356] [2022-07-14 14:03:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:56,992 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 252 states and 559 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,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:57,196 INFO L93 Difference]: Finished difference Result 282 states and 604 transitions. [2022-07-14 14:03:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:57,196 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,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:57,197 INFO L225 Difference]: With dead ends: 282 [2022-07-14 14:03:57,197 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 14:03:57,198 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,198 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:57,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 14:03:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2022-07-14 14:03:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 2.440677966101695) internal successors, (576), 259 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 576 transitions. [2022-07-14 14:03:57,203 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 576 transitions. Word has length 20 [2022-07-14 14:03:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:57,203 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 576 transitions. [2022-07-14 14:03:57,203 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,203 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 576 transitions. [2022-07-14 14:03:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:57,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:57,204 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:57,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 14:03:57,204 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1168272838, now seen corresponding path program 1 times [2022-07-14 14:03:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:57,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411650360] [2022-07-14 14:03:57,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:57,292 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:57,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:57,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411650360] [2022-07-14 14:03:57,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411650360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:03:57,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:03:57,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:03:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167269030] [2022-07-14 14:03:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:03:57,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:03:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:03:57,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:03:57,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:03:57,294 INFO L87 Difference]: Start difference. First operand 260 states and 576 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,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:03:57,507 INFO L93 Difference]: Finished difference Result 267 states and 571 transitions. [2022-07-14 14:03:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:03:57,508 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,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:03:57,509 INFO L225 Difference]: With dead ends: 267 [2022-07-14 14:03:57,509 INFO L226 Difference]: Without dead ends: 267 [2022-07-14 14:03:57,509 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,510 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:03:57,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:03:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-14 14:03:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 252. [2022-07-14 14:03:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 2.4166666666666665) internal successors, (551), 251 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 551 transitions. [2022-07-14 14:03:57,516 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 551 transitions. Word has length 20 [2022-07-14 14:03:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:03:57,516 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 551 transitions. [2022-07-14 14:03:57,516 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,516 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 551 transitions. [2022-07-14 14:03:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:03:57,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:03:57,516 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:03:57,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 14:03:57,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:03:57,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:03:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1168305691, now seen corresponding path program 1 times [2022-07-14 14:03:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:03:57,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268271833] [2022-07-14 14:03:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:03:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:57,617 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,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:03:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268271833] [2022-07-14 14:03:57,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268271833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:03:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163379202] [2022-07-14 14:03:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:03:57,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:03:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:03:57,619 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:57,620 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:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:03:57,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:03:57,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:03:57,703 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,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:03:57,756 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,802 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:08,931 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:08,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:15,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_33| Int) (|v_ULTIMATE.start_main_~i~2#1_120| Int) (v_ArrVal_437 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_33| v_ArrVal_436) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| v_ArrVal_437) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_120|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) (+ (* |v_ULTIMATE.start_main_~i~2#1_120| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155|)))) is different from false [2022-07-14 14:04:16,086 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:16,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163379202] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:16,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:16,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180661251] [2022-07-14 14:04:16,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=206, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:04:16,089 INFO L87 Difference]: Start difference. First operand 252 states and 551 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:04:16,093 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_436 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_33| Int) (|v_ULTIMATE.start_main_~i~2#1_120| Int) (v_ArrVal_437 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_33| v_ArrVal_436) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155| v_ArrVal_437) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) 2147483646) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_120|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_33|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_154|) (+ (* |v_ULTIMATE.start_main_~i~2#1_120| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_155|))))) is different from false [2022-07-14 14:04:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:16,713 INFO L93 Difference]: Finished difference Result 303 states and 643 transitions. [2022-07-14 14:04:16,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 14:04:16,714 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:04:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:16,715 INFO L225 Difference]: With dead ends: 303 [2022-07-14 14:04:16,715 INFO L226 Difference]: Without dead ends: 303 [2022-07-14 14:04:16,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=94, Invalid=236, Unknown=20, NotChecked=70, Total=420 [2022-07-14 14:04:16,716 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:16,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 314 Unchecked, 0.1s Time] [2022-07-14 14:04:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-14 14:04:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 254. [2022-07-14 14:04:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 230 states have (on average 2.4) internal successors, (552), 253 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 552 transitions. [2022-07-14 14:04:16,723 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 552 transitions. Word has length 20 [2022-07-14 14:04:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:16,723 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 552 transitions. [2022-07-14 14:04:16,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:04:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 552 transitions. [2022-07-14 14:04:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:04:16,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:16,725 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:16,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 14:04:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 14:04:16,943 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:04:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1176055102, now seen corresponding path program 1 times [2022-07-14 14:04:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:16,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274760962] [2022-07-14 14:04:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:17,082 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:04:17,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274760962] [2022-07-14 14:04:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274760962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:04:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:04:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:04:17,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836995058] [2022-07-14 14:04:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:04:17,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:04:17,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:04:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:04:17,085 INFO L87 Difference]: Start difference. First operand 254 states and 552 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:04:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:17,229 INFO L93 Difference]: Finished difference Result 282 states and 598 transitions. [2022-07-14 14:04:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 14:04:17,230 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:04:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:17,231 INFO L225 Difference]: With dead ends: 282 [2022-07-14 14:04:17,231 INFO L226 Difference]: Without dead ends: 282 [2022-07-14 14:04:17,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-07-14 14:04:17,231 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:17,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:04:17,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-14 14:04:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 263. [2022-07-14 14:04:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 239 states have (on average 2.3849372384937237) internal successors, (570), 262 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 570 transitions. [2022-07-14 14:04:17,237 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 570 transitions. Word has length 20 [2022-07-14 14:04:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 570 transitions. [2022-07-14 14:04:17,237 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:04:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 570 transitions. [2022-07-14 14:04:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:04:17,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:17,238 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 14:04:17,238 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:04:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 310229752, now seen corresponding path program 2 times [2022-07-14 14:04:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:17,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344092135] [2022-07-14 14:04:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:17,313 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:04:17,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:17,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344092135] [2022-07-14 14:04:17,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344092135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:04:17,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:04:17,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 14:04:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915936142] [2022-07-14 14:04:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:04:17,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 14:04:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:04:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:04:17,315 INFO L87 Difference]: Start difference. First operand 263 states and 570 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:04:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:17,502 INFO L93 Difference]: Finished difference Result 285 states and 603 transitions. [2022-07-14 14:04:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:04:17,502 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:04:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:17,504 INFO L225 Difference]: With dead ends: 285 [2022-07-14 14:04:17,504 INFO L226 Difference]: Without dead ends: 285 [2022-07-14 14:04:17,504 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:04:17,504 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:17,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 14:04:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-14 14:04:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2022-07-14 14:04:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 236 states have (on average 2.385593220338983) internal successors, (563), 259 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:04:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 563 transitions. [2022-07-14 14:04:17,509 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 563 transitions. Word has length 20 [2022-07-14 14:04:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:17,510 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 563 transitions. [2022-07-14 14:04:17,510 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:04:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 563 transitions. [2022-07-14 14:04:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:04:17,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:17,510 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:17,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 14:04:17,511 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:04:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1267351382, now seen corresponding path program 1 times [2022-07-14 14:04:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836892191] [2022-07-14 14:04:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:17,619 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:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836892191] [2022-07-14 14:04:17,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836892191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175236253] [2022-07-14 14:04:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:17,621 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:04:17,622 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:04:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:17,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:17,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:17,701 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:17,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:17,746 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:17,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, 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:32,576 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:32,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:04:40,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_34| Int) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_126|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_34|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_126| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_34| v_ArrVal_568) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| v_ArrVal_569) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) 2147483646))) is different from false [2022-07-14 14:04:40,209 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:40,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175236253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:04:40,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:04:40,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:04:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902598115] [2022-07-14 14:04:40,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:04:40,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:04:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:04:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:04:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=207, Unknown=20, NotChecked=32, Total=342 [2022-07-14 14:04:40,211 INFO L87 Difference]: Start difference. First operand 260 states and 563 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:04:40,216 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_568 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_34| Int) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_126|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_34|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_126| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_34| v_ArrVal_568) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_159| v_ArrVal_569) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_158|) 2147483646)))) is different from false [2022-07-14 14:04:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:04:44,208 INFO L93 Difference]: Finished difference Result 273 states and 597 transitions. [2022-07-14 14:04:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 14:04:44,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 14:04:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:04:44,210 INFO L225 Difference]: With dead ends: 273 [2022-07-14 14:04:44,211 INFO L226 Difference]: Without dead ends: 273 [2022-07-14 14:04:44,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=107, Invalid=258, Unknown=23, NotChecked=74, Total=462 [2022-07-14 14:04:44,212 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:04:44,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-07-14 14:04:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-14 14:04:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2022-07-14 14:04:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 241 states have (on average 2.4024896265560165) internal successors, (579), 264 states have internal predecessors, (579), 0 states have call successors, (0), 0 states 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:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 579 transitions. [2022-07-14 14:04:44,217 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 579 transitions. Word has length 20 [2022-07-14 14:04:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:04:44,217 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 579 transitions. [2022-07-14 14:04:44,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:04:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 579 transitions. [2022-07-14 14:04:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 14:04:44,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:04:44,218 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:04:44,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-14 14:04:44,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 14:04:44,434 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:04:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:04:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1267351403, now seen corresponding path program 1 times [2022-07-14 14:04:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:04:44,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342501186] [2022-07-14 14:04:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:04:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:44,523 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:44,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:04:44,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342501186] [2022-07-14 14:04:44,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342501186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:04:44,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11259418] [2022-07-14 14:04:44,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:04:44,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:04:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:04:44,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:04:44,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 14:04:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:04:44,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:04:44,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:04:44,624 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:44,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:04:44,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 14:04:44,715 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:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-14 14:04:55,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:05,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_35| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_35| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| v_ArrVal_639) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) is different from false [2022-07-14 14:05:05,144 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:05,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11259418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:05,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:05,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730852356] [2022-07-14 14:05:05,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:05,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:05,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:05,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=202, Unknown=21, NotChecked=32, Total=342 [2022-07-14 14:05:05,146 INFO L87 Difference]: Start difference. First operand 265 states and 579 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:05:05,150 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_638 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_35| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| Int) (v_ArrVal_639 Int) (|v_t_funThread1of1ForFork0_~i~0#1_130| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_35| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163| v_ArrVal_639) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|))) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_162|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_130| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_163|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_130|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:05:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:16,071 INFO L93 Difference]: Finished difference Result 319 states and 718 transitions. [2022-07-14 14:05:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 14:05:16,072 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:05:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:16,073 INFO L225 Difference]: With dead ends: 319 [2022-07-14 14:05:16,073 INFO L226 Difference]: Without dead ends: 319 [2022-07-14 14:05:16,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=125, Invalid=319, Unknown=26, NotChecked=82, Total=552 [2022-07-14 14:05:16,073 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:05:16,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-14 14:05:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-14 14:05:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 283. [2022-07-14 14:05:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 259 states have (on average 2.4555984555984556) internal successors, (636), 282 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 636 transitions. [2022-07-14 14:05:16,079 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 636 transitions. Word has length 20 [2022-07-14 14:05:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:16,079 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 636 transitions. [2022-07-14 14:05:16,079 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:05:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 636 transitions. [2022-07-14 14:05:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:05:16,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:16,080 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:16,098 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:05:16,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:16,292 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:05:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1857709808, now seen corresponding path program 1 times [2022-07-14 14:05:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:16,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861947470] [2022-07-14 14:05:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:16,396 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:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:16,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861947470] [2022-07-14 14:05:16,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861947470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:16,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468511060] [2022-07-14 14:05:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:16,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:16,397 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:05:16,398 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:05:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:16,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:16,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:16,507 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:16,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:16,554 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:16,597 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,162 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,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:05:37,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~2#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| Int) (v_ArrVal_710 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_36|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) (+ (* |v_ULTIMATE.start_main_~i~2#1_126| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_126|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_708) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| v_ArrVal_710) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) 2147483646))) is different from false [2022-07-14 14:05:37,645 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,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468511060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:05:37,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:05:37,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:05:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762034667] [2022-07-14 14:05:37,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:05:37,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:05:37,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:05:37,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:05:37,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=209, Unknown=18, NotChecked=32, Total=342 [2022-07-14 14:05:37,647 INFO L87 Difference]: Start difference. First operand 283 states and 636 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,652 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_~i~2#1_126| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_708 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| Int) (v_ArrVal_710 Int) (|ULTIMATE.start_main_~i~2#1| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_36|)) (< (+ (* |ULTIMATE.start_main_~i~2#1| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) (+ (* |v_ULTIMATE.start_main_~i~2#1_126| 28) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158|)) (not (<= (+ |ULTIMATE.start_main_~i~2#1| 1) |v_ULTIMATE.start_main_~i~2#1_126|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_708) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_158| v_ArrVal_710) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_157|) 2147483646)))) is different from false [2022-07-14 14:05:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:05:44,956 INFO L93 Difference]: Finished difference Result 315 states and 704 transitions. [2022-07-14 14:05:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:05:44,956 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:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:05:44,958 INFO L225 Difference]: With dead ends: 315 [2022-07-14 14:05:44,958 INFO L226 Difference]: Without dead ends: 315 [2022-07-14 14:05:44,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=126, Invalid=321, Unknown=23, NotChecked=82, Total=552 [2022-07-14 14:05:44,958 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:05:44,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 204 Unchecked, 0.1s Time] [2022-07-14 14:05:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-07-14 14:05:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2022-07-14 14:05:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 2.457692307692308) internal successors, (639), 283 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 639 transitions. [2022-07-14 14:05:44,963 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 639 transitions. Word has length 21 [2022-07-14 14:05:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:05:44,963 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 639 transitions. [2022-07-14 14:05:44,963 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:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 639 transitions. [2022-07-14 14:05:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:05:44,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:05:44,964 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:05:44,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-14 14:05:45,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:45,164 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:05:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:05:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash 633155323, now seen corresponding path program 1 times [2022-07-14 14:05:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:05:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522394410] [2022-07-14 14:05:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:05:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:45,255 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:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:05:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522394410] [2022-07-14 14:05:45,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522394410] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:05:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457593265] [2022-07-14 14:05:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:05:45,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:05:45,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:05:45,257 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:05:45,258 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:05:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:05:45,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:05:45,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:05:45,341 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:45,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:05:45,390 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:45,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:05:57,291 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:57,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:03,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_136| Int) (v_ArrVal_778 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_37| 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_779 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_136| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_136|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_778) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_779) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646))) is different from false [2022-07-14 14:06:03,307 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:03,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457593265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:03,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:03,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:06:03,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904443369] [2022-07-14 14:06:03,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:03,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:06:03,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:03,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:06:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=208, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:06:03,309 INFO L87 Difference]: Start difference. First operand 284 states and 639 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:06:03,314 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_136| Int) (v_ArrVal_778 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_37| 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_779 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_136| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_37|)) (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_136|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_778) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_779) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) 2147483646)))) is different from false [2022-07-14 14:06:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:06:07,191 INFO L93 Difference]: Finished difference Result 285 states and 642 transitions. [2022-07-14 14:06:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:06:07,191 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:06:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:06:07,192 INFO L225 Difference]: With dead ends: 285 [2022-07-14 14:06:07,192 INFO L226 Difference]: Without dead ends: 285 [2022-07-14 14:06:07,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=107, Invalid=259, Unknown=22, NotChecked=74, Total=462 [2022-07-14 14:06:07,193 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:06:07,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 181 Unchecked, 0.1s Time] [2022-07-14 14:06:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-14 14:06:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-07-14 14:06:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 261 states have (on average 2.4597701149425286) internal successors, (642), 284 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 642 transitions. [2022-07-14 14:06:07,198 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 642 transitions. Word has length 21 [2022-07-14 14:06:07,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:06:07,198 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 642 transitions. [2022-07-14 14:06:07,198 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:06:07,199 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 642 transitions. [2022-07-14 14:06:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:06:07,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:06:07,199 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:06:07,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 14:06:07,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:07,400 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:06:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:06:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 633155344, now seen corresponding path program 1 times [2022-07-14 14:06:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:06:07,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477645001] [2022-07-14 14:06:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:06:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:07,496 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:07,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:06:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477645001] [2022-07-14 14:06:07,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477645001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:06:07,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356741430] [2022-07-14 14:06:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:06:07,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:06:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:06:07,498 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:06:07,500 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:06:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:06:07,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:06:07,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:06:07,594 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:07,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:06:07,665 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:07,715 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:22,340 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:22,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:06:31,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_849 Int) (|v_t_funThread1of1ForFork0_~i~0#1_140| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_140|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_140| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_848) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| v_ArrVal_849) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|))))) is different from false [2022-07-14 14:06:31,430 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:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356741430] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:06:31,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:06:31,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-07-14 14:06:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39049985] [2022-07-14 14:06:31,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:06:31,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 14:06:31,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:06:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 14:06:31,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=261, Unknown=20, NotChecked=36, Total=420 [2022-07-14 14:06:31,432 INFO L87 Difference]: Start difference. First operand 285 states and 642 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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:31,436 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_849 Int) (|v_t_funThread1of1ForFork0_~i~0#1_140| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_140|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_140| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172|)) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_38|)) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_848) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_172| v_ArrVal_849) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|))))) (= |c_~#cache~0.base| 1) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|))) is different from false [2022-07-14 14:06:46,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= 1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| Int) (v_ArrVal_849 Int) (|v_t_funThread1of1ForFork0_~i~0#1_140| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_140| 28) |c_~#cache~0.offset|)) (not (<= (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_140|)) (<= 0 (+ 2147483649 (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_849)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_171|))))))) is different from false [2022-07-14 14:07:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:00,358 INFO L93 Difference]: Finished difference Result 420 states and 983 transitions. [2022-07-14 14:07:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 14:07:00,358 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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:07:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:00,360 INFO L225 Difference]: With dead ends: 420 [2022-07-14 14:07:00,360 INFO L226 Difference]: Without dead ends: 420 [2022-07-14 14:07:00,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=225, Invalid=563, Unknown=36, NotChecked=168, Total=992 [2022-07-14 14:07:00,361 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:00,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 422 Unchecked, 0.1s Time] [2022-07-14 14:07:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-14 14:07:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 306. [2022-07-14 14:07:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 282 states have (on average 2.482269503546099) internal successors, (700), 305 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 700 transitions. [2022-07-14 14:07:00,366 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 700 transitions. Word has length 21 [2022-07-14 14:07:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:00,367 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 700 transitions. [2022-07-14 14:07:00,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 20 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:07:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 700 transitions. [2022-07-14 14:07:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:07:00,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:00,367 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:00,386 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:07:00,587 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,SelfDestructingSolverStorable21 [2022-07-14 14:07:00,587 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:07:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash 633186943, now seen corresponding path program 2 times [2022-07-14 14:07:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:00,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103845851] [2022-07-14 14:07:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:00,683 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:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:00,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103845851] [2022-07-14 14:07:00,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103845851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:00,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815847994] [2022-07-14 14:07:00,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:07:00,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:00,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:00,685 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:07:00,686 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:07:00,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:07:00,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:07:00,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:07:00,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:00,785 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:00,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:00,829 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:00,870 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:12,310 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:12,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:19,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_t_funThread1of1ForFork0_~i~0#1_144| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_144|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_918) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| v_ArrVal_920) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| (* |v_t_funThread1of1ForFork0_~i~0#1_144| 28))))) is different from false [2022-07-14 14:07:19,348 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:19,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815847994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:19,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:19,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:07:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524225471] [2022-07-14 14:07:19,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:19,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:07:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:07:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=208, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:07:19,350 INFO L87 Difference]: Start difference. First operand 306 states and 700 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:19,354 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_39| Int) (|v_t_funThread1of1ForFork0_~i~0#1_144| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| Int) (v_ArrVal_918 (Array Int Int)) (v_ArrVal_920 Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_144|)) (<= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_918) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| v_ArrVal_920) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175|) 2147483646) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (< (+ (* |t_funThread1of1ForFork0_~i~0#1| 28) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_175|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_176| (* |v_t_funThread1of1ForFork0_~i~0#1_144| 28)))))) is different from false [2022-07-14 14:07:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:23,324 INFO L93 Difference]: Finished difference Result 307 states and 702 transitions. [2022-07-14 14:07:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:07:23,325 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:07:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:23,326 INFO L225 Difference]: With dead ends: 307 [2022-07-14 14:07:23,326 INFO L226 Difference]: Without dead ends: 307 [2022-07-14 14:07:23,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=107, Invalid=259, Unknown=22, NotChecked=74, Total=462 [2022-07-14 14:07:23,326 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:23,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 174 Unchecked, 0.0s Time] [2022-07-14 14:07:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-14 14:07:23,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-07-14 14:07:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 281 states have (on average 2.4839857651245554) internal successors, (698), 304 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 698 transitions. [2022-07-14 14:07:23,332 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 698 transitions. Word has length 21 [2022-07-14 14:07:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:23,332 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 698 transitions. [2022-07-14 14:07:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 698 transitions. [2022-07-14 14:07:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 14:07:23,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:23,333 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:23,349 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:07:23,543 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,SelfDestructingSolverStorable22 [2022-07-14 14:07:23,543 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:07:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 633186964, now seen corresponding path program 2 times [2022-07-14 14:07:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:23,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243985184] [2022-07-14 14:07:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:23,619 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,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:23,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243985184] [2022-07-14 14:07:23,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243985184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116186407] [2022-07-14 14:07:23,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 14:07:23,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:23,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:23,621 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:07:23,622 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:07:23,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 14:07:23,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:07:23,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:07:23,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:23,724 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:23,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:23,764 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:23,801 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:34,738 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:34,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:07:41,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_148| Int) (v_ArrVal_988 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| Int) (v_ArrVal_989 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_148|)) (< (+ (* |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_148| 28))) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_988) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| v_ArrVal_989) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|)))) is different from false [2022-07-14 14:07:42,046 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:42,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116186407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:07:42,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:07:42,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-07-14 14:07:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271987020] [2022-07-14 14:07:42,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:07:42,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 14:07:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:42,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 14:07:42,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=203, Unknown=19, NotChecked=32, Total=342 [2022-07-14 14:07:42,047 INFO L87 Difference]: Start difference. First operand 305 states and 698 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:42,052 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_#StackHeapBarrier|) (= ((as const (Array Int Int)) 0) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_148| Int) (v_ArrVal_988 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| Int) (v_ArrVal_989 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179| Int) (|t_funThread1of1ForFork0_~i~0#1| Int)) (or (not (<= (+ |t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_148|)) (< (+ (* |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_148| 28))) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_988) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_180| v_ArrVal_989) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_179|))) (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#t1~0#1.base_40|))))) is different from false [2022-07-14 14:07:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:58,040 INFO L93 Difference]: Finished difference Result 370 states and 887 transitions. [2022-07-14 14:07:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:07:58,041 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:07:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:58,042 INFO L225 Difference]: With dead ends: 370 [2022-07-14 14:07:58,042 INFO L226 Difference]: Without dead ends: 370 [2022-07-14 14:07:58,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=135, Invalid=352, Unknown=27, NotChecked=86, Total=600 [2022-07-14 14:07:58,043 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:58,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 319 Unchecked, 0.1s Time] [2022-07-14 14:07:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-14 14:07:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 312. [2022-07-14 14:07:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 288 states have (on average 2.5208333333333335) internal successors, (726), 311 states have internal predecessors, (726), 0 states have call successors, (0), 0 states 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:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 726 transitions. [2022-07-14 14:07:58,049 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 726 transitions. Word has length 21 [2022-07-14 14:07:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:58,050 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 726 transitions. [2022-07-14 14:07:58,050 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:07:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 726 transitions. [2022-07-14 14:07:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:58,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:58,050 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:58,073 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:07:58,267 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,SelfDestructingSolverStorable23 [2022-07-14 14:07:58,267 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:07:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1755316210, now seen corresponding path program 1 times [2022-07-14 14:07:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:58,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880427446] [2022-07-14 14:07:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:58,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:58,291 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:07:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880427446] [2022-07-14 14:07:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880427446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:07:58,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:07:58,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:07:58,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345603773] [2022-07-14 14:07:58,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:07:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:07:58,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:58,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:07:58,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:07:58,293 INFO L87 Difference]: Start difference. First operand 312 states and 726 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:07:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:58,326 INFO L93 Difference]: Finished difference Result 298 states and 692 transitions. [2022-07-14 14:07:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:07:58,326 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:07:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:58,327 INFO L225 Difference]: With dead ends: 298 [2022-07-14 14:07:58,327 INFO L226 Difference]: Without dead ends: 298 [2022-07-14 14:07:58,328 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:07:58,330 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:58,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:07:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-14 14:07:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-07-14 14:07:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 279 states have (on average 2.4802867383512543) internal successors, (692), 297 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 692 transitions. [2022-07-14 14:07:58,339 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 692 transitions. Word has length 22 [2022-07-14 14:07:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:58,339 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 692 transitions. [2022-07-14 14:07:58,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:07:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 692 transitions. [2022-07-14 14:07:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:58,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:58,340 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:58,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 14:07:58,340 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:07:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1755316197, now seen corresponding path program 1 times [2022-07-14 14:07:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595433462] [2022-07-14 14:07:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 14:07:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595433462] [2022-07-14 14:07:58,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595433462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:07:58,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:07:58,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:07:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537609153] [2022-07-14 14:07:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:07:58,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 14:07:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:07:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:07:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:07:58,369 INFO L87 Difference]: Start difference. First operand 298 states and 692 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:07:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:07:58,402 INFO L93 Difference]: Finished difference Result 284 states and 658 transitions. [2022-07-14 14:07:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:07:58,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 14:07:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 14:07:58,404 INFO L225 Difference]: With dead ends: 284 [2022-07-14 14:07:58,404 INFO L226 Difference]: Without dead ends: 284 [2022-07-14 14:07:58,404 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:07:58,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 14:07:58,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 14:07:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-14 14:07:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2022-07-14 14:07:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 241 states have (on average 2.4522821576763487) internal successors, (591), 254 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 591 transitions. [2022-07-14 14:07:58,411 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 591 transitions. Word has length 22 [2022-07-14 14:07:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 14:07:58,411 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 591 transitions. [2022-07-14 14:07:58,411 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:07:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 591 transitions. [2022-07-14 14:07:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 14:07:58,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 14:07:58,412 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:07:58,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 14:07:58,412 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2022-07-14 14:07:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:07:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1754430529, now seen corresponding path program 1 times [2022-07-14 14:07:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:07:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777028719] [2022-07-14 14:07:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:07:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:58,504 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:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:07:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777028719] [2022-07-14 14:07:58,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777028719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:07:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409137334] [2022-07-14 14:07:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:07:58,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:07:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:07:58,506 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:07:58,508 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:07:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:07:58,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 14:07:58,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:07:58,610 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:58,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 14:07:58,657 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:58,698 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