./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-zilu/benchmark20_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/benchmark20_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 a97cc7ecf3f325d6a4f94ad142da468f60264f8646a5f445527873ff4eb9457a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:58:44,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:58:44,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:58:44,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:58:44,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:58:44,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:58:44,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:58:44,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:58:44,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:58:44,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:58:44,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:58:44,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:58:44,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:58:44,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:58:44,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:58:44,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:58:44,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:58:44,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:58:44,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:58:44,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:58:44,548 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:58:44,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:58:44,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:58:44,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:58:44,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:58:44,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:58:44,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:58:44,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:58:44,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:58:44,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:58:44,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:58:44,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:58:44,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:58:44,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:58:44,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:58:44,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:58:44,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:58:44,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:58:44,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:58:44,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:58:44,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:58:44,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:58:44,566 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:58:44,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:58:44,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:58:44,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:58:44,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:58:44,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:58:44,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:58:44,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:58:44,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:58:44,596 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:58:44,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:58:44,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:58:44,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:58:44,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:58:44,599 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:58:44,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:58:44,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:58:44,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:58:44,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:58:44,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:58:44,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:58:44,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:58:44,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:58:44,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:58:44,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:58:44,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:58:44,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:58:44,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:58:44,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:58:44,603 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 -> a97cc7ecf3f325d6a4f94ad142da468f60264f8646a5f445527873ff4eb9457a [2022-07-14 13:58:44,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:58:44,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:58:44,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:58:44,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:58:44,847 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:58:44,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark20_conjunctive.i [2022-07-14 13:58:44,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379c0786/81d1a1a8aef643db8d0c5572d923122b/FLAG2c86944d5 [2022-07-14 13:58:45,342 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:58:45,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark20_conjunctive.i [2022-07-14 13:58:45,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379c0786/81d1a1a8aef643db8d0c5572d923122b/FLAG2c86944d5 [2022-07-14 13:58:45,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b379c0786/81d1a1a8aef643db8d0c5572d923122b [2022-07-14 13:58:45,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:58:45,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:58:45,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:58:45,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:58:45,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:58:45,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:58:45" (1/1) ... [2022-07-14 13:58:45,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681bb1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:45, skipping insertion in model container [2022-07-14 13:58:45,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:58:45" (1/1) ... [2022-07-14 13:58:45,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:58:45,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:58:45,964 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/benchmark20_conjunctive.i[873,886] [2022-07-14 13:58:45,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:58:45,983 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:58:45,997 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/benchmark20_conjunctive.i[873,886] [2022-07-14 13:58:46,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:58:46,019 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:58:46,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46 WrapperNode [2022-07-14 13:58:46,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:58:46,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:58:46,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:58:46,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:58:46,027 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:58:46" (1/1) ... [2022-07-14 13:58:46,033 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:58:46" (1/1) ... [2022-07-14 13:58:46,048 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2022-07-14 13:58:46,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:58:46,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:58:46,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:58:46,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:58:46,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:58:46,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:58:46,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:58:46,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:58:46,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (1/1) ... [2022-07-14 13:58:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:58:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:46,091 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:58:46,098 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:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:58:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:58:46,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:58:46,165 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:58:46,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:58:46,316 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:58:46,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:58:46,337 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 13:58:46,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:58:46 BoogieIcfgContainer [2022-07-14 13:58:46,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:58:46,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:58:46,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:58:46,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:58:46,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:58:45" (1/3) ... [2022-07-14 13:58:46,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675038fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:58:46, skipping insertion in model container [2022-07-14 13:58:46,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:58:46" (2/3) ... [2022-07-14 13:58:46,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675038fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:58:46, skipping insertion in model container [2022-07-14 13:58:46,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:58:46" (3/3) ... [2022-07-14 13:58:46,346 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.i [2022-07-14 13:58:46,358 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:58:46,371 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-07-14 13:58:46,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:58:46,449 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@4609ac0d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b9a65a1 [2022-07-14 13:58:46,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-14 13:58:46,456 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:58:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 13:58:46,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:46,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 13:58:46,468 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:58:46,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 28695973, now seen corresponding path program 1 times [2022-07-14 13:58:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397714970] [2022-07-14 13:58:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:46,638 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:58:46,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:46,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397714970] [2022-07-14 13:58:46,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397714970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:58:46,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:58:46,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:58:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243169827] [2022-07-14 13:58:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:58:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:58:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:58:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:58:46,678 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:58:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:46,736 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-07-14 13:58:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:58:46,738 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:58:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:46,744 INFO L225 Difference]: With dead ends: 34 [2022-07-14 13:58:46,744 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:58:46,748 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:58:46,754 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:58:46,755 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:58:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:58:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-07-14 13:58:46,779 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:58:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-07-14 13:58:46,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 5 [2022-07-14 13:58:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:46,782 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-07-14 13:58:46,783 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:58:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-07-14 13:58:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 13:58:46,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:46,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 13:58:46,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:58:46,785 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:58:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889575213, now seen corresponding path program 1 times [2022-07-14 13:58:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:46,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249224647] [2022-07-14 13:58:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:46,838 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:58:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:46,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249224647] [2022-07-14 13:58:46,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249224647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:58:46,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:58:46,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:58:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879602565] [2022-07-14 13:58:46,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:58:46,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:58:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:58:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:58:46,844 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:58:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:46,863 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-14 13:58:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:58:46,865 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:58:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:46,865 INFO L225 Difference]: With dead ends: 16 [2022-07-14 13:58:46,865 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:58:46,869 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:58:46,870 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:58:46,872 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:58:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:58:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 13:58:46,883 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:58:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-14 13:58:46,884 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-07-14 13:58:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:46,885 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 13:58:46,886 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:58:46,886 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-07-14 13:58:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 13:58:46,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:46,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:58:46,909 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:58:46,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1807027879, now seen corresponding path program 1 times [2022-07-14 13:58:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77707701] [2022-07-14 13:58:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:46,984 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:58:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:46,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77707701] [2022-07-14 13:58:46,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77707701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:58:46,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:58:46,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:58:46,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596135761] [2022-07-14 13:58:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:58:46,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:58:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:58:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:58:46,989 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:58:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:47,022 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-07-14 13:58:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:58:47,023 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:58:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:47,025 INFO L225 Difference]: With dead ends: 19 [2022-07-14 13:58:47,025 INFO L226 Difference]: Without dead ends: 18 [2022-07-14 13:58:47,027 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:58:47,032 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:58:47,033 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:58:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-14 13:58:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-07-14 13:58:47,037 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:58:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-14 13:58:47,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2022-07-14 13:58:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-14 13:58:47,038 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:58:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-14 13:58:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 13:58:47,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:47,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:47,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:58:47,039 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:58:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash 183289455, now seen corresponding path program 1 times [2022-07-14 13:58:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:47,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212232307] [2022-07-14 13:58:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:47,067 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:58:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212232307] [2022-07-14 13:58:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212232307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:58:47,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:58:47,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:58:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276306454] [2022-07-14 13:58:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:58:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:58:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:58:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:58:47,070 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:58:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:47,092 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-14 13:58:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:58:47,093 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:58:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:47,093 INFO L225 Difference]: With dead ends: 16 [2022-07-14 13:58:47,094 INFO L226 Difference]: Without dead ends: 15 [2022-07-14 13:58:47,095 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:58:47,096 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:58:47,097 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:58:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-14 13:58:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-14 13:58:47,101 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:58:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-14 13:58:47,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-07-14 13:58:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-14 13:58:47,102 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:58:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-07-14 13:58:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 13:58:47,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:47,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:47,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:58:47,104 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:58:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash 47508593, now seen corresponding path program 1 times [2022-07-14 13:58:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:47,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911284569] [2022-07-14 13:58:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:47,154 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:58:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911284569] [2022-07-14 13:58:47,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911284569] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:47,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924298060] [2022-07-14 13:58:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:47,159 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:58:47,188 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:58:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:47,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:58:47,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:47,320 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:58:47,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:47,380 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:58:47,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924298060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:47,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:47,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-14 13:58:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88439823] [2022-07-14 13:58:47,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:47,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:58:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:58:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:58:47,384 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:58:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:47,454 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-07-14 13:58:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 13:58:47,455 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:58:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:47,455 INFO L225 Difference]: With dead ends: 26 [2022-07-14 13:58:47,455 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 13:58:47,456 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:58:47,456 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:58:47,457 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:58:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 13:58:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-14 13:58:47,459 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:58:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-14 13:58:47,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2022-07-14 13:58:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:47,460 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-14 13:58:47,461 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:58:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-14 13:58:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 13:58:47,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:47,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:47,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 13:58:47,667 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:58:47,668 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:58:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1472766433, now seen corresponding path program 1 times [2022-07-14 13:58:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781424122] [2022-07-14 13:58:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:47,727 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:58:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:47,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781424122] [2022-07-14 13:58:47,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781424122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:47,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140546378] [2022-07-14 13:58:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:47,730 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:58:47,732 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:58:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:47,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:58:47,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:47,838 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:58:47,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:58:47,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140546378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:58:47,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:58:47,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-07-14 13:58:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643534142] [2022-07-14 13:58:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:58:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:58:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:58:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:58:47,841 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:58:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:47,886 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-07-14 13:58:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:58:47,886 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:58:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:47,887 INFO L225 Difference]: With dead ends: 23 [2022-07-14 13:58:47,888 INFO L226 Difference]: Without dead ends: 22 [2022-07-14 13:58:47,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:58:47,891 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:58:47,891 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:58:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-14 13:58:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 13:58:47,898 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:58:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-14 13:58:47,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 11 [2022-07-14 13:58:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:47,900 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-14 13:58:47,900 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:58:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-14 13:58:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 13:58:47,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:47,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 13:58:47,928 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:58:48,122 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:58:48,122 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:58:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1588880781, now seen corresponding path program 1 times [2022-07-14 13:58:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:48,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282053488] [2022-07-14 13:58:48,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:48,197 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:58:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:48,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282053488] [2022-07-14 13:58:48,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282053488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:48,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887036209] [2022-07-14 13:58:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:48,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:48,212 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:58:48,223 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:58:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:48,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:58:48,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:48,277 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:58:48,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:48,327 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:58:48,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887036209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:48,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:48,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-14 13:58:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90997617] [2022-07-14 13:58:48,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 13:58:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 13:58:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:58:48,329 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:58:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:48,389 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-07-14 13:58:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:58:48,389 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:58:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:48,390 INFO L225 Difference]: With dead ends: 32 [2022-07-14 13:58:48,390 INFO L226 Difference]: Without dead ends: 31 [2022-07-14 13:58:48,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:58:48,391 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:58:48,391 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:58:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-14 13:58:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-07-14 13:58:48,394 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:58:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-07-14 13:58:48,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 12 [2022-07-14 13:58:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:48,395 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-14 13:58:48,395 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:58:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-07-14 13:58:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:58:48,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:48,396 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-07-14 13:58:48,454 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:58:48,596 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:58:48,596 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:58:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1418773263, now seen corresponding path program 2 times [2022-07-14 13:58:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:48,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102730903] [2022-07-14 13:58:48,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:48,684 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:58:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102730903] [2022-07-14 13:58:48,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102730903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:48,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360512322] [2022-07-14 13:58:48,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:58:48,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:48,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:48,687 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:58:48,692 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:58:48,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:58:48,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:48,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:58:48,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:48,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:58:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:49,140 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:58:49,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360512322] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:49,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:49,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-07-14 13:58:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888975410] [2022-07-14 13:58:49,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:49,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 13:58:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 13:58:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-07-14 13:58:49,146 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:58:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:49,582 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-07-14 13:58:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 13:58:49,583 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:58:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:49,583 INFO L225 Difference]: With dead ends: 46 [2022-07-14 13:58:49,583 INFO L226 Difference]: Without dead ends: 45 [2022-07-14 13:58:49,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 13:58:49,584 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:49,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 24 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:58:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-14 13:58:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-14 13:58:49,589 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:58:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-14 13:58:49,590 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2022-07-14 13:58:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:49,590 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-14 13:58:49,590 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:58:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-07-14 13:58:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 13:58:49,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:49,591 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-07-14 13:58:49,615 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:58:49,795 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:58:49,795 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:58:49,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:49,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1410159193, now seen corresponding path program 2 times [2022-07-14 13:58:49,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:49,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992813362] [2022-07-14 13:58:49,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:49,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:49,896 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:58:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992813362] [2022-07-14 13:58:49,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992813362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:49,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968899467] [2022-07-14 13:58:49,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:58:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:49,898 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:58:49,899 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:58:49,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 13:58:49,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:49,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:58:49,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:49,980 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:58:49,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:50,043 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:58:50,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968899467] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:50,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:50,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 17 [2022-07-14 13:58:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358696715] [2022-07-14 13:58:50,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:50,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 13:58:50,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:50,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 13:58:50,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-14 13:58:50,047 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:50,252 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-07-14 13:58:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 13:58:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 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:58:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:50,255 INFO L225 Difference]: With dead ends: 42 [2022-07-14 13:58:50,255 INFO L226 Difference]: Without dead ends: 41 [2022-07-14 13:58:50,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-07-14 13:58:50,258 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 9 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:58:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-14 13:58:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-07-14 13:58:50,269 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:58:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-07-14 13:58:50,271 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 27 [2022-07-14 13:58:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:50,271 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-07-14 13:58:50,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-07-14 13:58:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:58:50,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:50,273 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2022-07-14 13:58:50,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 13:58:50,487 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:58:50,488 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:58:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 915144177, now seen corresponding path program 3 times [2022-07-14 13:58:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:50,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488703043] [2022-07-14 13:58:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:50,736 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:58:50,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488703043] [2022-07-14 13:58:50,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488703043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547119477] [2022-07-14 13:58:50,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:58:50,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:50,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:50,742 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:58:50,759 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:58:50,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-14 13:58:50,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:50,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 13:58:50,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:51,487 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:58:51,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:58:52,173 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:58:52,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547119477] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:58:52,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:58:52,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-14 13:58:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047301378] [2022-07-14 13:58:52,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:58:52,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 13:58:52,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:58:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 13:58:52,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1944, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 13:58:52,176 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:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:58:54,795 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-07-14 13:58:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 13:58:54,796 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:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:58:54,796 INFO L225 Difference]: With dead ends: 77 [2022-07-14 13:58:54,797 INFO L226 Difference]: Without dead ends: 76 [2022-07-14 13:58:54,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1221, Invalid=6261, Unknown=0, NotChecked=0, Total=7482 [2022-07-14 13:58:54,801 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:58:54,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 31 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 706 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-07-14 13:58:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-14 13:58:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-14 13:58:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2022-07-14 13:58:54,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 40 [2022-07-14 13:58:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:58:54,819 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2022-07-14 13:58:54,819 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:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-07-14 13:58:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 13:58:54,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:58:54,823 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1] [2022-07-14 13:58:54,840 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:55,031 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:55,032 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:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:58:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 197564965, now seen corresponding path program 4 times [2022-07-14 13:58:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:58:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884839149] [2022-07-14 13:58:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:58:55,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:58:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:58:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:58:55,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:58:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884839149] [2022-07-14 13:58:55,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884839149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:58:55,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990954087] [2022-07-14 13:58:55,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:58:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:58:55,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:58:55,552 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:55,597 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:55,620 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:58:55,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:58:55,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 13:58:55,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:58:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:58:56,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:01:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 462 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:01:54,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990954087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:01:54,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:01:54,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2022-07-14 14:01:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044344336] [2022-07-14 14:01:54,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:01:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-14 14:01:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:01:54,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-14 14:01:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=6954, Unknown=70, NotChecked=0, Total=7832 [2022-07-14 14:01:54,617 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 89 states, 88 states have (on average 2.5113636363636362) internal successors, (221), 89 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 14:02:00,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|))) (let ((.cse1 (* (- 1) |c_ULTIMATE.start_main_#t~post4#1|)) (.cse19 (+ (div (+ .cse0 2147483639) 2) 1)) (.cse2 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse17 (div (+ .cse0 2147483634) 2)) (.cse20 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse18 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ .cse0 .cse1 2147483641) 2)) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ .cse0 2147483644 .cse2) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_40| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse5 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_40| 2)) (.cse4 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse7 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse3 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse3 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_40| 2) |v_ULTIMATE.start_main_~i~0#1_38|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse4) (+ .cse3 .cse5 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse6 .cse5 |c_ULTIMATE.start_main_~sum~0#1| .cse7) 2147483617) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ .cse6 |c_ULTIMATE.start_main_~sum~0#1| .cse4 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse7) (+ .cse3 2147483620))))))) (forall ((|aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| Int) (|aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| Int)) (let ((.cse8 (* |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| 2))) (or (<= (+ .cse8 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| (* 4 |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|)) 2147483634) (> 0 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|) (>= |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| 2) (<= 2147483637 (+ .cse8 |c_ULTIMATE.start_main_~sum~0#1| (* 5 |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|))) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse11 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse10 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse9 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse9 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse10) (+ .cse9 .cse11 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_38|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse11 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| .cse12) 2147483617) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse10 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1| .cse12) (+ .cse9 2147483620))))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) (div (+ .cse0 .cse2 2147483639) 2)) 2)) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int)) (let ((.cse13 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ .cse13 5 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse13 2147483622)) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| |c_ULTIMATE.start_main_#t~post4#1| 1) (div (+ 2147483621 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|)) 2))))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3))) (.cse16 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 2)) (.cse15 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= .cse14 (+ .cse15 2147483623)) (<= (+ .cse15 2147483627) .cse14) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse16 |c_ULTIMATE.start_main_#t~post4#1|) 2147483621) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= 2147483623 (+ |c_ULTIMATE.start_main_~sum~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| .cse16)) (<= |c_ULTIMATE.start_main_#t~post4#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ .cse15 4 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|)))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ (- 4) .cse1 .cse17) 2)) (<= .cse18 .cse19) (<= |c_ULTIMATE.start_main_~i~0#1| (+ (div (+ (- 1) (div (+ 2147483624 .cse0 .cse2) 2) .cse2) 2) 1)) (<= .cse20 (div .cse19 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse22 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse21 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse24 (* |v_ULTIMATE.start_main_~i~0#1_40| 2)) (.cse23 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse25 (* |v_ULTIMATE.start_main_~i~0#1_38| 2))) (or (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_40|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse21 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_40| 2) |v_ULTIMATE.start_main_~i~0#1_38|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse22) (+ .cse21 .cse23 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ .cse24 |c_ULTIMATE.start_main_~sum~0#1| .cse22 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1| .cse25) (+ .cse21 2147483619)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse24 .cse23 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| .cse25) 2147483616)))) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1295) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse27 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse29 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse28 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse26 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse26 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse27 |c_ULTIMATE.start_main_~sum~0#1| .cse28) 2147483618) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse29) (+ .cse26 .cse27 1)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse29 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse28) (+ .cse26 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_38| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) .cse2 .cse17) 2)) (<= .cse20 (div (+ .cse0 2147483646) 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483646) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse30 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse31 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse32 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse30 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse31 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse31 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse30) (+ .cse31 .cse32 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse32 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483618) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (<= (+ .cse18 |c_ULTIMATE.start_main_~sum~0#1|) 2147483646) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse34 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse33 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse35 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse33 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse34 (* |v_ULTIMATE.start_main_~i~0#1_36| 2)) (+ .cse33 2147483622)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse34) (+ .cse33 .cse35 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse35 |c_ULTIMATE.start_main_~sum~0#1|) 2147483619))))))))) is different from false [2022-07-14 14:02:03,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_main_#t~post4#1|)) (.cse16 (+ |c_ULTIMATE.start_main_#t~post4#1| 1)) (.cse0 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|))) (and (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ .cse0 .cse1 2147483641) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_40| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_40| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse4 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_40| 2)) (.cse3 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse2 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse2 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_40| 2) |v_ULTIMATE.start_main_~i~0#1_38|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse3) (+ .cse2 .cse4 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse5 .cse4 |c_ULTIMATE.start_main_~sum~0#1| .cse6) 2147483617) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ .cse5 |c_ULTIMATE.start_main_~sum~0#1| .cse3 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse6) (+ .cse2 2147483620))))))) (forall ((|aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| Int) (|aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| Int)) (let ((.cse7 (* |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| 2))) (or (<= (+ .cse7 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| (* 4 |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|)) 2147483634) (> 0 |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|) (>= |aux_mod_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63| 2) (<= 2147483637 (+ .cse7 |c_ULTIMATE.start_main_~sum~0#1| (* 5 |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|))) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_div_v_ULTIMATE.start_main_~i~0#1_32_107_63|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse10 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse9 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse8 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse9) (+ .cse8 .cse10 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_38|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse10 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| .cse11) 2147483617) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse9 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1| .cse11) (+ .cse8 2147483620))))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int)) (let ((.cse12 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ .cse12 5 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse12 2147483622)) (<= (+ |c_ULTIMATE.start_main_#t~post4#1| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| |c_ULTIMATE.start_main_#t~post4#1| 1) (div (+ 2147483621 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|)) 2))))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int)) (let ((.cse13 (+ |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3))) (.cse15 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 2)) (.cse14 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= .cse13 (+ .cse14 2147483623)) (<= (+ .cse14 2147483627) .cse13) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse15 |c_ULTIMATE.start_main_#t~post4#1|) 2147483621) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= 2147483623 (+ |c_ULTIMATE.start_main_~sum~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| .cse15)) (<= |c_ULTIMATE.start_main_#t~post4#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ .cse14 4 |c_ULTIMATE.start_main_#t~post4#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|)))) (<= |c_ULTIMATE.start_main_#t~post4#1| (div (+ (- 4) .cse1 (div (+ .cse0 2147483634) 2)) 2)) (<= .cse16 (div (+ (div (+ .cse0 2147483639) 2) 1) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse18 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse17 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse20 (* |v_ULTIMATE.start_main_~i~0#1_40| 2)) (.cse19 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse21 (* |v_ULTIMATE.start_main_~i~0#1_38| 2))) (or (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_40|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse17 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_40| 2) |v_ULTIMATE.start_main_~i~0#1_38|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse18) (+ .cse17 .cse19 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ .cse20 |c_ULTIMATE.start_main_~sum~0#1| .cse18 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1| .cse21) (+ .cse17 2147483619)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse20 .cse19 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1| .cse21) 2147483616)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse23 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse25 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse24 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse22 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse22 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse23 |c_ULTIMATE.start_main_~sum~0#1| .cse24) 2147483618) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse25) (+ .cse22 .cse23 1)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse25 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse24) (+ .cse22 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (not (<= |v_ULTIMATE.start_main_~i~0#1_38| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))))) (<= .cse16 (div (+ .cse0 2147483646) 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483646) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse26 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse27 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse28 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse26 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) |c_ULTIMATE.start_main_#t~post4#1|) (+ .cse27 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse27 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse26) (+ .cse27 .cse28 1)) (< (+ 2 |c_ULTIMATE.start_main_#t~post4#1|) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse28 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_#t~post4#1|) 2147483618) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_#t~post4#1| 1))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse30 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse29 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse31 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse29 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse30 (* |v_ULTIMATE.start_main_~i~0#1_36| 2)) (+ .cse29 2147483622)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse30) (+ .cse29 .cse31 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse31 |c_ULTIMATE.start_main_~sum~0#1|) 2147483619)))))))) is different from false [2022-07-14 14:02:05,931 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (* (- 1) |c_ULTIMATE.start_main_~sum~0#1|)) (.cse7 (* 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ .cse0 2147483644 .cse1) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse3 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_40| 2)) (.cse6 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse5 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_40|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse2 .cse3 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1| .cse4) 2147483617) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse5 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |v_ULTIMATE.start_main_~i~0#1_40| 2) |v_ULTIMATE.start_main_~i~0#1_38|) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse6) (+ .cse5 .cse3 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ .cse2 |c_ULTIMATE.start_main_~sum~0#1| .cse6 |c_ULTIMATE.start_main_~i~0#1| (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse4) (+ .cse5 2147483620)) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) (div (+ .cse0 .cse1 2147483639) 2)) 2)) (<= .cse7 (+ (div (+ .cse0 2147483639) 2) 1)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ (div (+ (- 1) (div (+ 2147483624 .cse0 .cse1) 2) .cse1) 2) 1)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1|) 2147483647) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int)) (let ((.cse8 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= |c_ULTIMATE.start_main_~i~0#1| |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ .cse8 |c_ULTIMATE.start_main_~i~0#1| 4) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 2)) 2147483621) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3) |c_ULTIMATE.start_main_~i~0#1|) (+ .cse8 2147483623))))) (forall ((|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse9 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse11 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse10 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~sum~0#1| .cse9) (+ .cse10 2147483622)) (<= (+ .cse9 |c_ULTIMATE.start_main_~i~0#1|) (+ .cse10 .cse11 1)) (<= (+ |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| |c_ULTIMATE.start_main_~i~0#1| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= (+ .cse11 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1|) 2147483619) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ .cse10 5 |c_ULTIMATE.start_main_~i~0#1|) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse14 (* |v_ULTIMATE.start_main_~i~0#1_38| 2)) (.cse13 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse12 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse15 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_38|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse12 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse13 |c_ULTIMATE.start_main_~i~0#1| (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse14) (+ .cse12 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse15 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1| .cse14) 2147483618) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse13) (+ .cse12 .cse15 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_38| Int) (|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse18 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse16 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse17 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse20 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse19 (* |v_ULTIMATE.start_main_~i~0#1_38| 2))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse16 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18 (* |v_ULTIMATE.start_main_~i~0#1_36| 2) .cse19) (+ .cse16 2147483620)) (< (+ |v_ULTIMATE.start_main_~i~0#1_38| 2) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse18) (+ .cse16 .cse20 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_38|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse17 .cse20 |c_ULTIMATE.start_main_~sum~0#1| .cse19) 2147483617)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse21 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|)) (.cse23 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse22 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse21 |c_ULTIMATE.start_main_~sum~0#1| |c_ULTIMATE.start_main_~i~0#1|) 2147483619) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse22 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse23) (+ .cse22 .cse21 1)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) (<= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse23 |c_ULTIMATE.start_main_~i~0#1| (* |v_ULTIMATE.start_main_~i~0#1_36| 2)) (+ .cse22 2147483622))))) (<= |c_ULTIMATE.start_main_~i~0#1| (div (+ (- 1) .cse1 (div (+ .cse0 2147483634) 2)) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int) (|aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| Int) (|aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155| Int) (|aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68| Int)) (let ((.cse24 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse25 (* |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 3)) (.cse26 (* 2 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)) (.cse27 (* 2 |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|))) (or (<= (+ .cse24 |c_ULTIMATE.start_main_~sum~0#1| .cse25 (* |v_ULTIMATE.start_main_~i~0#1_36| 2)) (+ .cse26 2147483621)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse26 5) |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse24 .cse27 |c_ULTIMATE.start_main_~sum~0#1|) 2147483618) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| .cse25) (+ .cse26 .cse27 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_36|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| 1) |aux_div_v_ULTIMATE.start_main_~sum~0#1_62_68|) (<= |aux_div_v_ULTIMATE.start_main_~i~0#1_34_107| (+ (* 3 |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|) 2)) (<= (+ |v_ULTIMATE.start_main_~i~0#1_36| 1) |aux_div_aux_mod_v_ULTIMATE.start_main_~i~0#1_34_107_155|)))) (<= (+ .cse7 |c_ULTIMATE.start_main_~sum~0#1|) 2147483646))) is different from false [2022-07-14 14:02:22,113 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-14 14:02:22,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-07-14 14:02:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-14 14:02:22,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1757 ImplicationChecksByTransitivity, 187.3s TimeCoverageRelationStatistics Valid=1913, Invalid=11832, Unknown=73, NotChecked=702, Total=14520 [2022-07-14 14:02:22,117 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 441 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 14:02:22,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 61 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2374 Invalid, 0 Unknown, 441 Unchecked, 1.4s Time] [2022-07-14 14:02:22,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 14:02:22,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:02:22,328 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 48 more [2022-07-14 14:02:22,332 INFO L158 Benchmark]: Toolchain (without parser) took 216568.59ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 72.7MB in the beginning and 34.5MB in the end (delta: 38.2MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2022-07-14 14:02:22,332 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:02:22,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.44ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 72.5MB in the beginning and 100.9MB in the end (delta: -28.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:02:22,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.20ms. Allocated memory is still 125.8MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:02:22,333 INFO L158 Benchmark]: Boogie Preprocessor took 16.12ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 980.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:02:22,333 INFO L158 Benchmark]: RCFGBuilder took 272.79ms. Allocated memory is still 125.8MB. Free memory was 98.3MB in the beginning and 89.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 14:02:22,333 INFO L158 Benchmark]: TraceAbstraction took 215991.11ms. Allocated memory is still 125.8MB. Free memory was 88.3MB in the beginning and 34.5MB in the end (delta: 53.8MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2022-07-14 14:02:22,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 61.0MB in the beginning and 61.0MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.44ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 72.5MB in the beginning and 100.9MB in the end (delta: -28.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.20ms. Allocated memory is still 125.8MB. Free memory was 100.9MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.12ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 98.3MB in the end (delta: 980.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.79ms. Allocated memory is still 125.8MB. Free memory was 98.3MB in the beginning and 89.2MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 215991.11ms. Allocated memory is still 125.8MB. Free memory was 88.3MB in the beginning and 34.5MB in the end (delta: 53.8MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")