./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark08_conjunctive.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/loop-zilu/benchmark08_conjunctive.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 58639ff425b05f7497b3d6ac8d1e0a9c9e2e7663b2f2f0cb8654fd8932f07edd --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:57:28,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:57:28,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:57:28,136 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:57:28,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:57:28,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:57:28,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:57:28,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:57:28,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:57:28,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:57:28,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:57:28,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:57:28,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:57:28,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:57:28,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:57:28,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:57:28,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:57:28,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:57:28,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:57:28,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:57:28,154 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:57:28,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:57:28,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:57:28,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:57:28,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:57:28,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:57:28,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:57:28,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:57:28,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:57:28,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:57:28,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:57:28,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:57:28,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:57:28,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:57:28,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:57:28,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:57:28,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:57:28,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:57:28,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:57:28,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:57:28,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:57:28,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:57:28,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:57:28,185 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:57:28,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:57:28,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:57:28,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:57:28,186 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:57:28,186 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:57:28,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:57:28,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:57:28,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:57:28,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:57:28,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:57:28,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:57:28,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:57:28,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:57:28,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:57:28,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:57:28,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:57:28,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:57:28,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:57:28,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:57:28,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:57:28,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:57:28,190 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 -> 58639ff425b05f7497b3d6ac8d1e0a9c9e2e7663b2f2f0cb8654fd8932f07edd [2022-07-14 13:57:28,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:57:28,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:57:28,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:57:28,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:57:28,388 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:57:28,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark08_conjunctive.i [2022-07-14 13:57:28,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3400be40/b9d03bf88bb643328478508633df6f43/FLAGdd57fe78a [2022-07-14 13:57:28,807 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:57:28,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark08_conjunctive.i [2022-07-14 13:57:28,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3400be40/b9d03bf88bb643328478508633df6f43/FLAGdd57fe78a [2022-07-14 13:57:29,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3400be40/b9d03bf88bb643328478508633df6f43 [2022-07-14 13:57:29,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:57:29,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:57:29,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:57:29,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:57:29,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:57:29,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7992ddb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29, skipping insertion in model container [2022-07-14 13:57:29,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:57:29,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:57:29,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark08_conjunctive.i[873,886] [2022-07-14 13:57:29,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:57:29,366 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:57:29,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark08_conjunctive.i[873,886] [2022-07-14 13:57:29,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:57:29,396 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:57:29,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29 WrapperNode [2022-07-14 13:57:29,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:57:29,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:57:29,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:57:29,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:57:29,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,420 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2022-07-14 13:57:29,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:57:29,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:57:29,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:57:29,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:57:29,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:57:29,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:57:29,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:57:29,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:57:29,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (1/1) ... [2022-07-14 13:57:29,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:57:29,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:29,465 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 13:57:29,470 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 13:57:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:57:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:57:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:57:29,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:57:29,545 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:57:29,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:57:29,616 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:57:29,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:57:29,621 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 13:57:29,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:57:29 BoogieIcfgContainer [2022-07-14 13:57:29,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:57:29,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:57:29,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:57:29,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:57:29,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:57:29" (1/3) ... [2022-07-14 13:57:29,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b23017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:57:29, skipping insertion in model container [2022-07-14 13:57:29,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:57:29" (2/3) ... [2022-07-14 13:57:29,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b23017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:57:29, skipping insertion in model container [2022-07-14 13:57:29,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:57:29" (3/3) ... [2022-07-14 13:57:29,628 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark08_conjunctive.i [2022-07-14 13:57:29,637 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:57:29,638 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-07-14 13:57:29,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:57:29,677 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@6f3a0854, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c590f1b [2022-07-14 13:57:29,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-14 13:57:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 13:57:29,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:29,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 13:57:29,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:29,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 28695973, now seen corresponding path program 1 times [2022-07-14 13:57:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:29,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874435086] [2022-07-14 13:57:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:29,834 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 13:57:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:29,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874435086] [2022-07-14 13:57:29,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874435086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:29,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:29,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:57:29,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759538940] [2022-07-14 13:57:29,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:29,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:57:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:29,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:57:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:57:29,862 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:29,919 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-14 13:57:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:57:29,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 13:57:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:29,925 INFO L225 Difference]: With dead ends: 34 [2022-07-14 13:57:29,929 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:57:29,937 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 13:57:29,940 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:29,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:57:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-07-14 13:57:29,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-07-14 13:57:29,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 5 [2022-07-14 13:57:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:29,984 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-07-14 13:57:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-07-14 13:57:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 13:57:29,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:29,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 13:57:29,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:57:29,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash 889575213, now seen corresponding path program 1 times [2022-07-14 13:57:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:29,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108073931] [2022-07-14 13:57:29,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,024 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 13:57:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:30,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108073931] [2022-07-14 13:57:30,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108073931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:30,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:30,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:57:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33928248] [2022-07-14 13:57:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:30,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:57:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:57:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:57:30,028 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:30,044 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-14 13:57:30,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:57:30,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 13:57:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:30,047 INFO L225 Difference]: With dead ends: 16 [2022-07-14 13:57:30,048 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:57:30,048 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 13:57:30,049 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:30,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:57:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 13:57:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-14 13:57:30,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-07-14 13:57:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:30,057 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 13:57:30,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-07-14 13:57:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 13:57:30,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:30,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:30,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:57:30,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1807027879, now seen corresponding path program 1 times [2022-07-14 13:57:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570109597] [2022-07-14 13:57:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,094 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 13:57:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:30,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570109597] [2022-07-14 13:57:30,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570109597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:30,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:30,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:57:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657144259] [2022-07-14 13:57:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:30,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:57:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:57:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:57:30,098 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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 13:57:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:30,128 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-07-14 13:57:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:57:30,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 7 [2022-07-14 13:57:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:30,130 INFO L225 Difference]: With dead ends: 19 [2022-07-14 13:57:30,130 INFO L226 Difference]: Without dead ends: 18 [2022-07-14 13:57:30,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:57:30,132 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:30,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-14 13:57:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-07-14 13:57:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-14 13:57:30,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2022-07-14 13:57:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:30,140 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-14 13:57:30,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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 13:57:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-14 13:57:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 13:57:30,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:30,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:30,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:57:30,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 183289455, now seen corresponding path program 1 times [2022-07-14 13:57:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:30,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484713006] [2022-07-14 13:57:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,173 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 13:57:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484713006] [2022-07-14 13:57:30,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484713006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:30,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:57:30,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:57:30,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914938075] [2022-07-14 13:57:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:30,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:57:30,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:57:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:57:30,176 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:30,195 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-14 13:57:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:57:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-14 13:57:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:30,196 INFO L225 Difference]: With dead ends: 16 [2022-07-14 13:57:30,196 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:57:30,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:57:30,198 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:30,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:30,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:57:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 13:57:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-14 13:57:30,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-07-14 13:57:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:30,205 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 13:57:30,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-07-14 13:57:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 13:57:30,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:30,206 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:57:30,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 47508593, now seen corresponding path program 1 times [2022-07-14 13:57:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044868008] [2022-07-14 13:57:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:30,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:30,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044868008] [2022-07-14 13:57:30,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044868008] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:30,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473647180] [2022-07-14 13:57:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:30,243 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 13:57:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:57:30,277 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 13:57:30,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:30,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:30,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473647180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:30,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:30,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-14 13:57:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943686855] [2022-07-14 13:57:30,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:57:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:57:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:57:30,435 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:30,505 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-07-14 13:57:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 13:57:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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 13:57:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:30,510 INFO L225 Difference]: With dead ends: 26 [2022-07-14 13:57:30,510 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 13:57:30,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:57:30,514 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:30,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 13:57:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-14 13:57:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-14 13:57:30,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2022-07-14 13:57:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:30,517 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-14 13:57:30,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-14 13:57:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 13:57:30,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:30,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:30,545 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 13:57:30,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:30,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:30,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1472766433, now seen corresponding path program 1 times [2022-07-14 13:57:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:30,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618365233] [2022-07-14 13:57:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618365233] [2022-07-14 13:57:30,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618365233] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218246270] [2022-07-14 13:57:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:30,775 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 13:57:30,778 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 13:57:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:30,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:57:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:30,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:57:30,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218246270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:57:30,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:57:30,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-07-14 13:57:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055157352] [2022-07-14 13:57:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:57:30,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:57:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:30,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:57:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:57:30,900 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 13:57:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:30,954 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-07-14 13:57:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:57:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 11 [2022-07-14 13:57:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:30,955 INFO L225 Difference]: With dead ends: 23 [2022-07-14 13:57:30,955 INFO L226 Difference]: Without dead ends: 22 [2022-07-14 13:57:30,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:57:30,956 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-14 13:57:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 13:57:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-14 13:57:30,959 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 11 [2022-07-14 13:57:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:30,959 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 13:57:30,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 13:57:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-14 13:57:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 13:57:30,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:30,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 13:57:30,988 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 13:57:31,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-14 13:57:31,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1588880781, now seen corresponding path program 1 times [2022-07-14 13:57:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:31,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489804009] [2022-07-14 13:57:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:31,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:31,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:31,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489804009] [2022-07-14 13:57:31,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489804009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:31,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685038141] [2022-07-14 13:57:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:31,214 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 13:57:31,272 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 13:57:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:31,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:57:31,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:31,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:31,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685038141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:31,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:31,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-14 13:57:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758126] [2022-07-14 13:57:31,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:31,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 13:57:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 13:57:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:57:31,353 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:31,414 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-07-14 13:57:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:57:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 12 [2022-07-14 13:57:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:31,415 INFO L225 Difference]: With dead ends: 32 [2022-07-14 13:57:31,415 INFO L226 Difference]: Without dead ends: 31 [2022-07-14 13:57:31,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:57:31,416 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:31,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-14 13:57:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-14 13:57:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-07-14 13:57:31,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 12 [2022-07-14 13:57:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:31,420 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-14 13:57:31,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-07-14 13:57:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:57:31,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:31,420 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-14 13:57:31,447 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 13:57:31,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:31,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1418773263, now seen corresponding path program 2 times [2022-07-14 13:57:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:31,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228391588] [2022-07-14 13:57:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:31,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:31,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228391588] [2022-07-14 13:57:31,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228391588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:31,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944078015] [2022-07-14 13:57:31,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:57:31,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:31,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:31,736 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 13:57:31,737 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 13:57:31,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:57:31,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:31,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:57:31,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:31,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:32,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944078015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:32,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:32,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-07-14 13:57:32,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554180008] [2022-07-14 13:57:32,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:32,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 13:57:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 13:57:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-07-14 13:57:32,135 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:32,416 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-07-14 13:57:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 13:57:32,417 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 13:57:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:32,417 INFO L225 Difference]: With dead ends: 45 [2022-07-14 13:57:32,417 INFO L226 Difference]: Without dead ends: 44 [2022-07-14 13:57:32,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2022-07-14 13:57:32,418 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:32,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 19 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:57:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-14 13:57:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-07-14 13:57:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-14 13:57:32,423 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2022-07-14 13:57:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:32,425 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-14 13:57:32,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-07-14 13:57:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 13:57:32,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:32,426 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-07-14 13:57:32,450 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 13:57:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:32,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1410159193, now seen corresponding path program 2 times [2022-07-14 13:57:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818498969] [2022-07-14 13:57:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:32,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:32,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818498969] [2022-07-14 13:57:32,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818498969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:32,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705668276] [2022-07-14 13:57:32,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:57:32,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:32,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:32,739 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 13:57:32,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 13:57:32,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:32,779 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 13:57:32,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:57:32,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:57:32,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:57:32,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705668276] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:32,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:32,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-07-14 13:57:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194545145] [2022-07-14 13:57:32,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:32,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 13:57:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 13:57:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-14 13:57:32,863 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:57:32,997 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-07-14 13:57:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 13:57:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 13:57:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:57:32,998 INFO L225 Difference]: With dead ends: 42 [2022-07-14 13:57:32,998 INFO L226 Difference]: Without dead ends: 41 [2022-07-14 13:57:32,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-07-14 13:57:33,001 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:57:33,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 6 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:57:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-14 13:57:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-14 13:57:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-07-14 13:57:33,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 27 [2022-07-14 13:57:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:57:33,013 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-07-14 13:57:33,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:57:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-07-14 13:57:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:57:33,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:57:33,015 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2022-07-14 13:57:33,040 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 13:57:33,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:33,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:57:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:57:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash 915144177, now seen corresponding path program 3 times [2022-07-14 13:57:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:57:33,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094586628] [2022-07-14 13:57:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:57:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:57:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:57:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:57:33,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094586628] [2022-07-14 13:57:33,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094586628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:57:33,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869905297] [2022-07-14 13:57:33,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:57:33,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:57:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:57:33,433 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 13:57:33,434 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 13:57:33,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-14 13:57:33,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:57:33,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 13:57:33,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:57:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:33,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:57:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:57:51,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869905297] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:57:51,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:57:51,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-14 13:57:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148729628] [2022-07-14 13:57:51,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:57:51,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 13:57:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:57:51,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 13:57:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1819, Unknown=11, NotChecked=0, Total=2162 [2022-07-14 13:57:51,720 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:58:04,108 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification. DAG size of input: 104 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 13:58:41,605 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 97 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 13:58:56,455 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 62 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 13:58:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:57,164 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-07-14 13:58:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-14 13:58:57,164 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 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 40 [2022-07-14 13:58:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:57,165 INFO L225 Difference]: With dead ends: 82 [2022-07-14 13:58:57,165 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 13:58:57,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 83.1s TimeCoverageRelationStatistics Valid=913, Invalid=3621, Unknown=22, NotChecked=0, Total=4556 [2022-07-14 13:58:57,168 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 87 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:57,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 29 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 195 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2022-07-14 13:58:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 13:58:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-14 13:58:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:58:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-07-14 13:58:57,174 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 40 [2022-07-14 13:58:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:57,174 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-07-14 13:58:57,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 47 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:58:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-07-14 13:58:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 13:58:57,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:57,176 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1] [2022-07-14 13:58:57,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 13:58:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:57,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:58:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1816526833, now seen corresponding path program 4 times [2022-07-14 13:58:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688290658] [2022-07-14 13:58:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:58:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:57,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688290658] [2022-07-14 13:58:57,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688290658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:57,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361556581] [2022-07-14 13:58:57,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:58:57,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:57,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:58,002 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 13:58:58,002 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 13:58:58,054 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:58:58,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:58,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 13:58:58,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:58:59,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:01:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:01:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361556581] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:01:21,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:01:21,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2022-07-14 14:01:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126416383] [2022-07-14 14:01:21,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:01:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-14 14:01:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:01:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-14 14:01:21,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=7692, Unknown=58, NotChecked=0, Total=8930 [2022-07-14 14:01:21,275 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand has 95 states, 94 states have (on average 2.5106382978723403) internal successors, (236), 95 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:01:24,485 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|))) (let ((.cse11 (* (- 1) |c_ULTIMATE.start_main_#t~post4#1|)) (.cse26 (+ (div (+ .cse10 2147483639) 2) 1)) (.cse12 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse24 (div (+ .cse10 2147483634) 2)) (.cse32 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse25 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse0 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse2 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ .cse0 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ 2147483621 .cse1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |c_ULTIMATE.start_main_~sum~0#1| .cse2 |c_ULTIMATE.start_main_#t~post4#1|) 2147483618) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse1) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse0) (+ .cse1 .cse2 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_39| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse5 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse6 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse3) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ .cse4 .cse5 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ 2147483621 .cse3)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse5) (+ .cse3 .cse6 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse4 |c_ULTIMATE.start_main_~sum~0#1| .cse6) 2147483618)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int)) (or (forall ((|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse7 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)) (.cse9 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse8 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |c_ULTIMATE.start_main_~sum~0#1| .cse7) 2147483619) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse8) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse9) (+ .cse8 .cse7 1)) (<= (+ .cse9 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ .cse8 2147483622)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_37| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ .cse10 .cse11 2147483641) 2)) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ .cse10 2147483644 .cse12) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int)) (let ((.cse13 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse15 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse16 (* |v_ULTIMATE.start_main_~i~0#1_43| 2)) (.cse14 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse17 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse18 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ .cse13 .cse14 |c_ULTIMATE.start_main_~sum~0#1| .cse15 (* |v_ULTIMATE.start_main_~i~0#1_37| 2) .cse16) (+ 2147483619 .cse17)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse13 |c_ULTIMATE.start_main_~sum~0#1| .cse15 .cse18 .cse16) 2147483616) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse17) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse14) (+ .cse17 .cse18 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (< (+ |v_ULTIMATE.start_main_~i~0#1_43| 2) |v_ULTIMATE.start_main_~i~0#1_41|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse21 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse19 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse20 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse22 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse19) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ .cse20 .cse21 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse19 2147483620)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse21) (+ .cse19 .cse22 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse20 |c_ULTIMATE.start_main_~sum~0#1| .cse22 |c_ULTIMATE.start_main_#t~post4#1|) 2147483617) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) (div (+ .cse10 .cse12 2147483639) 2)) 2)) (forall ((|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse23 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= (+ |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| |c_ULTIMATE.start_main_#t~post4#1| 1) (div (+ 2147483621 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|)) 2)) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ 5 .cse23 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3) |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse23 2147483622))))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ (- 4) .cse11 .cse24) 2)) (<= .cse25 .cse26) (forall ((|v_ULTIMATE.start_main_~i~0#1_41| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse28 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse31 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse27 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse30 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse27) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse28 |c_ULTIMATE.start_main_~sum~0#1| .cse29 .cse30) 2147483617) (<= (+ .cse28 .cse31 |c_ULTIMATE.start_main_~sum~0#1| .cse29 (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ .cse27 2147483620)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse31) (+ .cse27 .cse30 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ (div (+ (- 1) (div (+ 2147483624 .cse10 .cse12) 2) .cse12) 2) 1)) (<= .cse32 (div .cse26 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1|) 2147483647) (forall ((|aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| Int) (|aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| Int)) (let ((.cse33 (* 2 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|))) (or (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse33 (* |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 4) |c_ULTIMATE.start_main_#t~post4#1|) 2147483634) (<= 2147483637 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse33 (* |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 5))) (>= |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 2) (> 0 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|)))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) .cse12 .cse24) 2)) (forall ((|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse36 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 2)) (.cse34 (+ (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse35 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= .cse34 (+ 2147483623 .cse35)) (<= |c_ULTIMATE.start_main_#t~post4#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= 2147483623 (+ |c_ULTIMATE.start_main_~sum~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| .cse36)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse36 |c_ULTIMATE.start_main_#t~post4#1|) 2147483621) (<= (+ 2147483627 .cse35) .cse34) (<= (+ .cse35 4 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int)) (let ((.cse37 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse39 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse38 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse40 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse41 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ .cse37 .cse38 |c_ULTIMATE.start_main_~sum~0#1| .cse39 (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ 2147483619 .cse40)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse40) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse37 |c_ULTIMATE.start_main_~sum~0#1| .cse39 .cse41 |c_ULTIMATE.start_main_#t~post4#1|) 2147483616) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse38) (+ .cse40 .cse41 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_41|) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (<= .cse32 (div (+ .cse10 2147483646) 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483646) (<= (+ .cse25 |c_ULTIMATE.start_main_~sum~0#1|) 2147483646)))) is different from false [2022-07-14 14:01:27,244 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* (- 1) |c_ULTIMATE.start_main_#t~post4#1|)) (.cse28 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse10 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse0 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse1 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse2 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ .cse0 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ 2147483621 .cse1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |c_ULTIMATE.start_main_~sum~0#1| .cse2 |c_ULTIMATE.start_main_#t~post4#1|) 2147483618) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse1) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse0) (+ .cse1 .cse2 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_39| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse5 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse3 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse6 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse3) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ .cse4 .cse5 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ 2147483621 .cse3)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse5) (+ .cse3 .cse6 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse4 |c_ULTIMATE.start_main_~sum~0#1| .cse6) 2147483618)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int)) (or (forall ((|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse7 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)) (.cse9 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse8 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |c_ULTIMATE.start_main_~sum~0#1| .cse7) 2147483619) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse8) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse9) (+ .cse8 .cse7 1)) (<= (+ .cse9 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ .cse8 2147483622)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_37| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ .cse10 .cse11 2147483641) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_43| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int)) (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse14 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse15 (* |v_ULTIMATE.start_main_~i~0#1_43| 2)) (.cse13 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse16 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse17 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ .cse12 .cse13 |c_ULTIMATE.start_main_~sum~0#1| .cse14 (* |v_ULTIMATE.start_main_~i~0#1_37| 2) .cse15) (+ 2147483619 .cse16)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse12 |c_ULTIMATE.start_main_~sum~0#1| .cse14 .cse17 .cse15) 2147483616) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse16) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse13) (+ .cse16 .cse17 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (< (+ |v_ULTIMATE.start_main_~i~0#1_43| 2) |v_ULTIMATE.start_main_~i~0#1_41|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_43| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse20 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse18 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse19 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse21 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse18) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ .cse19 .cse20 |c_ULTIMATE.start_main_~sum~0#1| (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse18 2147483620)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse20) (+ .cse18 .cse21 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse19 |c_ULTIMATE.start_main_~sum~0#1| .cse21 |c_ULTIMATE.start_main_#t~post4#1|) 2147483617) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (forall ((|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse22 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= (+ |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| |c_ULTIMATE.start_main_#t~post4#1| 1) (div (+ 2147483621 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|)) 2)) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= (+ 5 .cse22 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3) |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse22 2147483622))))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ (- 4) .cse11 (div (+ .cse10 2147483634) 2)) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_41| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_41| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse24 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse25 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse27 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse23 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse26 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse23) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse24 |c_ULTIMATE.start_main_~sum~0#1| .cse25 .cse26) 2147483617) (<= (+ .cse24 .cse27 |c_ULTIMATE.start_main_~sum~0#1| .cse25 (* |v_ULTIMATE.start_main_~i~0#1_37| 2)) (+ .cse23 2147483620)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse27) (+ .cse23 .cse26 1)) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))))) (<= .cse28 (div (+ (div (+ .cse10 2147483639) 2) 1) 2)) (forall ((|aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| Int) (|aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| Int)) (let ((.cse29 (* 2 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|))) (or (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse29 (* |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 4) |c_ULTIMATE.start_main_#t~post4#1|) 2147483634) (<= 2147483637 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse29 (* |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 5))) (>= |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63| 2) (> 0 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_33_107_63|)))) (forall ((|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int)) (let ((.cse32 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 2)) (.cse30 (+ (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse31 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2))) (or (<= .cse30 (+ 2147483623 .cse31)) (<= |c_ULTIMATE.start_main_#t~post4#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= 2147483623 (+ |c_ULTIMATE.start_main_~sum~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| .cse32)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse32 |c_ULTIMATE.start_main_#t~post4#1|) 2147483621) (<= (+ 2147483627 .cse31) .cse30) (<= (+ .cse31 4 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int) (|v_ULTIMATE.start_main_~i~0#1_37| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| Int) (|v_ULTIMATE.start_main_~i~0#1_41| Int)) (let ((.cse33 (* |v_ULTIMATE.start_main_~i~0#1_39| 2)) (.cse35 (* |v_ULTIMATE.start_main_~i~0#1_41| 2)) (.cse34 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 3)) (.cse36 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 2)) (.cse37 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155|) (< (+ |v_ULTIMATE.start_main_~i~0#1_39| 2) |v_ULTIMATE.start_main_~i~0#1_37|) (<= (+ .cse33 .cse34 |c_ULTIMATE.start_main_~sum~0#1| .cse35 (* |v_ULTIMATE.start_main_~i~0#1_37| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ 2147483619 .cse36)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| 5 .cse36) |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| (+ 2 (* |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_35_107_155| 3))) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse33 |c_ULTIMATE.start_main_~sum~0#1| .cse35 .cse37 |c_ULTIMATE.start_main_#t~post4#1|) 2147483616) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| .cse34) (+ .cse36 .cse37 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_41|) (< (+ |v_ULTIMATE.start_main_~i~0#1_41| 2) |v_ULTIMATE.start_main_~i~0#1_39|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_37| |aux_div_v_ULTIMATE.start_main_~i~0#1_35_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_64_68|)))) (<= .cse28 (div (+ .cse10 2147483646) 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483646))) is different from false