/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:36:49,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:36:49,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:36:49,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:36:49,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:36:49,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:36:49,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:36:49,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:36:49,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:36:49,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:36:49,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:36:49,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:36:49,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:36:49,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:36:49,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:36:49,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:36:49,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:36:49,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:36:49,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:36:49,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:36:49,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:36:49,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:36:49,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:36:49,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:36:49,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:36:49,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:36:49,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:36:49,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:36:49,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:36:49,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:36:49,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:36:49,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:36:49,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:36:49,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:36:49,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:36:49,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:36:49,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:36:49,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:36:49,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:36:49,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:36:49,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:36:49,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:36:49,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:36:49,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:36:49,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:36:49,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:36:49,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:36:49,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:36:49,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:36:49,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:36:49,206 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:36:49,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:36:49,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:36:49,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:36:49,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:36:49,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:36:49,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:36:49,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:36:49,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:36:49,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:36:49,208 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:36:49,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:36:49,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:36:49,209 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:36:49,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:36:49,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:36:49,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:36:49,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:36:49,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:36:49,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:36:49,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:36:49,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:36:49,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:36:49,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:36:49,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:36:49,212 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 [2022-10-15 21:36:49,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:36:49,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:36:49,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:36:49,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:36:49,679 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:36:49,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-10-15 21:36:49,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c2a1a40/c41ded4b8c334a4c8382198aa3cce83a/FLAG83fdd3e77 [2022-10-15 21:36:50,499 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:36:50,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-10-15 21:36:50,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c2a1a40/c41ded4b8c334a4c8382198aa3cce83a/FLAG83fdd3e77 [2022-10-15 21:36:50,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57c2a1a40/c41ded4b8c334a4c8382198aa3cce83a [2022-10-15 21:36:50,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:36:50,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:36:50,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:36:50,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:36:50,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:36:50,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:36:50" (1/1) ... [2022-10-15 21:36:50,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f314d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:50, skipping insertion in model container [2022-10-15 21:36:50,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:36:50" (1/1) ... [2022-10-15 21:36:50,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:36:50,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:36:51,246 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/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-10-15 21:36:51,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:36:51,269 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:36:51,362 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/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-10-15 21:36:51,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:36:51,415 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:36:51,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51 WrapperNode [2022-10-15 21:36:51,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:36:51,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:36:51,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:36:51,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:36:51,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,504 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2022-10-15 21:36:51,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:36:51,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:36:51,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:36:51,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:36:51,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:36:51,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:36:51,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:36:51,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:36:51,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (1/1) ... [2022-10-15 21:36:51,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:36:51,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:51,591 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-10-15 21:36:51,596 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-10-15 21:36:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-15 21:36:51,658 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-15 21:36:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:36:51,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:36:51,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:36:51,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:36:51,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:36:51,845 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:36:51,848 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:36:51,896 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-15 21:36:52,333 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:36:52,351 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:36:52,357 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 21:36:52,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:36:52 BoogieIcfgContainer [2022-10-15 21:36:52,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:36:52,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:36:52,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:36:52,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:36:52,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:36:50" (1/3) ... [2022-10-15 21:36:52,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bad8a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:36:52, skipping insertion in model container [2022-10-15 21:36:52,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:36:51" (2/3) ... [2022-10-15 21:36:52,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bad8a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:36:52, skipping insertion in model container [2022-10-15 21:36:52,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:36:52" (3/3) ... [2022-10-15 21:36:52,394 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-10-15 21:36:52,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:36:52,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 21:36:52,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:36:52,514 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@285c42ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:36:52,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 21:36:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 21:36:52,533 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:52,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:52,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 620997708, now seen corresponding path program 1 times [2022-10-15 21:36:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:52,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970974749] [2022-10-15 21:36:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:53,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970974749] [2022-10-15 21:36:53,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970974749] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:53,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:53,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:36:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895134038] [2022-10-15 21:36:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:36:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:53,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:36:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:36:53,165 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 38 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-10-15 21:36:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:53,231 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-10-15 21:36:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:36:53,235 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-10-15 21:36:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:53,243 INFO L225 Difference]: With dead ends: 65 [2022-10-15 21:36:53,244 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 21:36:53,248 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-10-15 21:36:53,253 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:53,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 80 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:36:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 21:36:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 21:36:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.391304347826087) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-15 21:36:53,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2022-10-15 21:36:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:53,305 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-15 21:36:53,306 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-10-15 21:36:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-15 21:36:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 21:36:53,307 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:53,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:53,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:36:53,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:53,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2071059830, now seen corresponding path program 1 times [2022-10-15 21:36:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:53,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375370059] [2022-10-15 21:36:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:53,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375370059] [2022-10-15 21:36:53,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375370059] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:53,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:53,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:36:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708467607] [2022-10-15 21:36:53,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:53,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:36:53,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:53,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:36:53,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:36:53,462 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:53,530 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-10-15 21:36:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:36:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 21:36:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:53,537 INFO L225 Difference]: With dead ends: 51 [2022-10-15 21:36:53,537 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 21:36:53,538 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-10-15 21:36:53,540 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:53,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:36:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 21:36:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 21:36:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-15 21:36:53,567 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 9 [2022-10-15 21:36:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:53,568 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-15 21:36:53,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-15 21:36:53,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 21:36:53,571 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:53,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:53,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:36:53,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -491799378, now seen corresponding path program 1 times [2022-10-15 21:36:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:53,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221653376] [2022-10-15 21:36:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:36:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:53,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221653376] [2022-10-15 21:36:53,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221653376] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:53,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:53,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:36:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003533816] [2022-10-15 21:36:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:53,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:36:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:36:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:36:53,846 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-10-15 21:36:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:53,928 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-10-15 21:36:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:36:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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) Word has length 15 [2022-10-15 21:36:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:53,933 INFO L225 Difference]: With dead ends: 36 [2022-10-15 21:36:53,933 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 21:36:53,937 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-10-15 21:36:53,949 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:53,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:36:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 21:36:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 21:36:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 33 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-10-15 21:36:53,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2022-10-15 21:36:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:53,966 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-10-15 21:36:53,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-10-15 21:36:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-10-15 21:36:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 21:36:53,968 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:53,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:36:53,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:53,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1061738802, now seen corresponding path program 1 times [2022-10-15 21:36:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:53,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528780577] [2022-10-15 21:36:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:36:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:54,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528780577] [2022-10-15 21:36:54,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528780577] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:54,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:54,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:36:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845152591] [2022-10-15 21:36:54,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:36:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:36:54,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:36:54,316 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:54,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:54,452 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-10-15 21:36:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:36:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-15 21:36:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:54,454 INFO L225 Difference]: With dead ends: 50 [2022-10-15 21:36:54,492 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 21:36:54,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:36:54,494 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:54,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 84 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 21:36:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-10-15 21:36:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-10-15 21:36:54,504 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2022-10-15 21:36:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:54,505 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-10-15 21:36:54,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-10-15 21:36:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 21:36:54,506 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:54,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:54,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:36:54,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1445835604, now seen corresponding path program 1 times [2022-10-15 21:36:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:54,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117253146] [2022-10-15 21:36:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117253146] [2022-10-15 21:36:54,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117253146] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919265476] [2022-10-15 21:36:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:54,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:54,742 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-10-15 21:36:54,766 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-10-15 21:36:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:54,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:36:54,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:55,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:36:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:55,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919265476] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:36:55,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:36:55,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-15 21:36:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16543184] [2022-10-15 21:36:55,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:36:55,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:36:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:36:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:36:55,105 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:55,193 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-10-15 21:36:55,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:36:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 21:36:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:55,206 INFO L225 Difference]: With dead ends: 72 [2022-10-15 21:36:55,206 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 21:36:55,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:36:55,210 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:55,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:36:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 21:36:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 21:36:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-10-15 21:36:55,232 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 19 [2022-10-15 21:36:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:55,233 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-10-15 21:36:55,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-10-15 21:36:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:36:55,236 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:55,236 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:55,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:36:55,449 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-10-15 21:36:55,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash -864257004, now seen corresponding path program 2 times [2022-10-15 21:36:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204442863] [2022-10-15 21:36:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:36:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204442863] [2022-10-15 21:36:55,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204442863] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122126864] [2022-10-15 21:36:55,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:36:55,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:55,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:55,752 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-10-15 21:36:55,772 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-10-15 21:36:55,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 21:36:55,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:36:55,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:36:55,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:36:56,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:36:56,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122126864] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:56,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:36:56,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-10-15 21:36:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690471564] [2022-10-15 21:36:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:56,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:36:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:56,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:36:56,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:36:56,044 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:56,110 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-10-15 21:36:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:36:56,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 29 [2022-10-15 21:36:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:56,115 INFO L225 Difference]: With dead ends: 46 [2022-10-15 21:36:56,115 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 21:36:56,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:36:56,122 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:56,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:36:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 21:36:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 21:36:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.175) internal successors, (47), 43 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-10-15 21:36:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-10-15 21:36:56,140 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2022-10-15 21:36:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:56,141 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-10-15 21:36:56,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-10-15 21:36:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:36:56,144 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:56,144 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:56,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 21:36:56,357 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-10-15 21:36:56,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1022123430, now seen corresponding path program 1 times [2022-10-15 21:36:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661453622] [2022-10-15 21:36:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:36:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:56,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661453622] [2022-10-15 21:36:56,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661453622] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:56,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933222254] [2022-10-15 21:36:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:56,548 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-10-15 21:36:56,570 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-10-15 21:36:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:56,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 21:36:56,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:36:56,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:36:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:36:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933222254] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:36:56,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:36:56,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 13 [2022-10-15 21:36:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756928167] [2022-10-15 21:36:56,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:36:56,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 21:36:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 21:36:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-10-15 21:36:56,882 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-10-15 21:36:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:57,022 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-10-15 21:36:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 21:36:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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 30 [2022-10-15 21:36:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:57,024 INFO L225 Difference]: With dead ends: 78 [2022-10-15 21:36:57,024 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 21:36:57,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2022-10-15 21:36:57,026 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:57,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 129 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 21:36:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-10-15 21:36:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-10-15 21:36:57,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2022-10-15 21:36:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:57,036 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-10-15 21:36:57,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 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-10-15 21:36:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-10-15 21:36:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 21:36:57,038 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:57,038 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:57,081 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-10-15 21:36:57,251 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-10-15 21:36:57,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:57,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 556444902, now seen corresponding path program 1 times [2022-10-15 21:36:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:57,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414974446] [2022-10-15 21:36:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:57,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:57,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414974446] [2022-10-15 21:36:57,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414974446] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:57,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:57,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:36:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134268991] [2022-10-15 21:36:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:57,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:36:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:57,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:36:57,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:36:57,578 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-10-15 21:36:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:57,731 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-10-15 21:36:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 21:36:57,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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 37 [2022-10-15 21:36:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:57,736 INFO L225 Difference]: With dead ends: 67 [2022-10-15 21:36:57,736 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 21:36:57,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:36:57,738 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:57,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 100 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 21:36:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-10-15 21:36:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-10-15 21:36:57,748 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-10-15 21:36:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:57,749 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-10-15 21:36:57,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-10-15 21:36:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-10-15 21:36:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:36:57,751 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:57,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:57,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:36:57,752 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 69922889, now seen corresponding path program 1 times [2022-10-15 21:36:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239046756] [2022-10-15 21:36:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:58,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:58,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239046756] [2022-10-15 21:36:58,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239046756] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:36:58,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:36:58,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:36:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866567294] [2022-10-15 21:36:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:36:58,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:36:58,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:36:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:36:58,072 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-10-15 21:36:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:58,192 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-10-15 21:36:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 21:36:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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) Word has length 38 [2022-10-15 21:36:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:58,194 INFO L225 Difference]: With dead ends: 64 [2022-10-15 21:36:58,194 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 21:36:58,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:36:58,196 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:58,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 116 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 21:36:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-10-15 21:36:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-10-15 21:36:58,205 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 38 [2022-10-15 21:36:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:58,205 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-10-15 21:36:58,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-10-15 21:36:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-10-15 21:36:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 21:36:58,207 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:58,207 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:58,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:36:58,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:58,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1256059568, now seen corresponding path program 1 times [2022-10-15 21:36:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:58,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095425746] [2022-10-15 21:36:58,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:58,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:58,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:58,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095425746] [2022-10-15 21:36:58,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095425746] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:58,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694646360] [2022-10-15 21:36:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:58,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:58,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:58,462 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-10-15 21:36:58,490 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-10-15 21:36:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:58,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:36:58,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:58,807 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:58,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:36:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:58,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694646360] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:36:58,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:36:58,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-10-15 21:36:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603908100] [2022-10-15 21:36:58,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:36:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 21:36:58,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 21:36:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:36:58,934 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:59,122 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-10-15 21:36:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 21:36:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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 38 [2022-10-15 21:36:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:59,124 INFO L225 Difference]: With dead ends: 83 [2022-10-15 21:36:59,124 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 21:36:59,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2022-10-15 21:36:59,126 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:59,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 123 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 21:36:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-10-15 21:36:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-10-15 21:36:59,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2022-10-15 21:36:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:36:59,137 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-10-15 21:36:59,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:36:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-10-15 21:36:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 21:36:59,138 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:36:59,138 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:36:59,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 21:36:59,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:59,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:36:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:36:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash 187477628, now seen corresponding path program 2 times [2022-10-15 21:36:59,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:36:59,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280189833] [2022-10-15 21:36:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:36:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:36:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:36:59,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:36:59,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280189833] [2022-10-15 21:36:59,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280189833] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:36:59,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570337392] [2022-10-15 21:36:59,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:36:59,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:36:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:36:59,571 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-10-15 21:36:59,575 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-10-15 21:36:59,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 21:36:59,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:36:59,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:36:59,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:36:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:59,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:36:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:36:59,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570337392] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:36:59,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:36:59,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-10-15 21:36:59,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746869122] [2022-10-15 21:36:59,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:36:59,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-15 21:36:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:36:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-15 21:36:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-10-15 21:36:59,855 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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-10-15 21:36:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:36:59,983 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-10-15 21:36:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 21:36:59,984 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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) Word has length 40 [2022-10-15 21:36:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:36:59,987 INFO L225 Difference]: With dead ends: 90 [2022-10-15 21:36:59,987 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 21:36:59,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2022-10-15 21:36:59,989 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:36:59,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 188 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:36:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 21:37:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-10-15 21:37:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-10-15 21:37:00,002 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 40 [2022-10-15 21:37:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:00,002 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-10-15 21:37:00,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 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-10-15 21:37:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-10-15 21:37:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-15 21:37:00,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:00,006 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:00,048 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-10-15 21:37:00,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 21:37:00,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:00,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash 426663804, now seen corresponding path program 1 times [2022-10-15 21:37:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:00,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432058426] [2022-10-15 21:37:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:00,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432058426] [2022-10-15 21:37:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432058426] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39649676] [2022-10-15 21:37:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:00,521 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-10-15 21:37:00,540 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-10-15 21:37:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:00,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 21:37:00,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:00,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:37:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:00,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39649676] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:37:00,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:37:00,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-10-15 21:37:00,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25144471] [2022-10-15 21:37:00,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:37:00,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 21:37:00,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:00,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 21:37:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-10-15 21:37:00,999 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:37:01,407 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-10-15 21:37:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 21:37:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 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 42 [2022-10-15 21:37:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:37:01,409 INFO L225 Difference]: With dead ends: 108 [2022-10-15 21:37:01,409 INFO L226 Difference]: Without dead ends: 107 [2022-10-15 21:37:01,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 21:37:01,412 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 132 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:37:01,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 215 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:37:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-15 21:37:01,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-10-15 21:37:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.12) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-10-15 21:37:01,432 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 42 [2022-10-15 21:37:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:01,432 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-10-15 21:37:01,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.05) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-10-15 21:37:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 21:37:01,434 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:01,434 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:01,477 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-10-15 21:37:01,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:01,649 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:01,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash 502478809, now seen corresponding path program 1 times [2022-10-15 21:37:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:01,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067733169] [2022-10-15 21:37:01,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067733169] [2022-10-15 21:37:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067733169] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:01,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131382194] [2022-10-15 21:37:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:01,985 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-10-15 21:37:01,990 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-10-15 21:37:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:02,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 21:37:02,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:02,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:37:02,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131382194] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:37:02,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:37:02,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2022-10-15 21:37:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955969468] [2022-10-15 21:37:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:37:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 21:37:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 21:37:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-10-15 21:37:02,307 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:37:02,441 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-10-15 21:37:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 21:37:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-10-15 21:37:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:37:02,443 INFO L225 Difference]: With dead ends: 104 [2022-10-15 21:37:02,443 INFO L226 Difference]: Without dead ends: 103 [2022-10-15 21:37:02,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-10-15 21:37:02,445 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:37:02,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 135 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:37:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-15 21:37:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2022-10-15 21:37:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.103448275862069) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-10-15 21:37:02,457 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 43 [2022-10-15 21:37:02,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:02,457 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-10-15 21:37:02,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-10-15 21:37:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 21:37:02,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:02,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:02,501 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-10-15 21:37:02,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:02,674 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1064823530, now seen corresponding path program 1 times [2022-10-15 21:37:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:02,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979929880] [2022-10-15 21:37:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979929880] [2022-10-15 21:37:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979929880] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623042253] [2022-10-15 21:37:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:03,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:37:03,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 21:37:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:03,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-15 21:37:03,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:03,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:37:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:03,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623042253] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:37:03,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:37:03,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-10-15 21:37:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490228630] [2022-10-15 21:37:03,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:37:03,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 21:37:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 21:37:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2022-10-15 21:37:03,687 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:37:04,225 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-10-15 21:37:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-15 21:37:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 states have internal predecessors, (86), 0 states have call successors, (0), 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 52 [2022-10-15 21:37:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:37:04,227 INFO L225 Difference]: With dead ends: 129 [2022-10-15 21:37:04,227 INFO L226 Difference]: Without dead ends: 128 [2022-10-15 21:37:04,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2022-10-15 21:37:04,230 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 218 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:37:04,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 223 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:37:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-10-15 21:37:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2022-10-15 21:37:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.092783505154639) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-15 21:37:04,242 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 52 [2022-10-15 21:37:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:04,243 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-15 21:37:04,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 31 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-15 21:37:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 21:37:04,244 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:04,245 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:04,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 21:37:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 21:37:04,460 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1889247868, now seen corresponding path program 3 times [2022-10-15 21:37:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884735764] [2022-10-15 21:37:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:04,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:04,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884735764] [2022-10-15 21:37:04,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884735764] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278555384] [2022-10-15 21:37:04,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 21:37:04,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:04,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:37:04,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 21:37:11,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-15 21:37:11,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:37:11,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 21:37:11,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:11,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:37:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:11,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278555384] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:37:11,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:37:11,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2022-10-15 21:37:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210906844] [2022-10-15 21:37:11,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:37:11,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-15 21:37:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-15 21:37:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2022-10-15 21:37:11,654 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:37:12,013 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2022-10-15 21:37:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-15 21:37:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 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 60 [2022-10-15 21:37:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:37:12,015 INFO L225 Difference]: With dead ends: 165 [2022-10-15 21:37:12,015 INFO L226 Difference]: Without dead ends: 164 [2022-10-15 21:37:12,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=602, Invalid=1468, Unknown=0, NotChecked=0, Total=2070 [2022-10-15 21:37:12,018 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 155 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:37:12,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 213 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:37:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-10-15 21:37:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2022-10-15 21:37:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.1240875912408759) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-10-15 21:37:12,033 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 60 [2022-10-15 21:37:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:12,033 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-10-15 21:37:12,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-10-15 21:37:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 21:37:12,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:12,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:12,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 21:37:12,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 21:37:12,249 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1154450364, now seen corresponding path program 2 times [2022-10-15 21:37:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281559918] [2022-10-15 21:37:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281559918] [2022-10-15 21:37:12,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281559918] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461106240] [2022-10-15 21:37:12,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 21:37:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:12,823 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:37:12,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 21:37:13,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 21:37:13,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:37:13,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 21:37:13,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:13,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:37:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461106240] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:37:13,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:37:13,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2022-10-15 21:37:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551562343] [2022-10-15 21:37:13,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:37:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-15 21:37:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-15 21:37:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2022-10-15 21:37:13,761 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:37:14,544 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-10-15 21:37:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-15 21:37:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 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 62 [2022-10-15 21:37:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:37:14,546 INFO L225 Difference]: With dead ends: 198 [2022-10-15 21:37:14,547 INFO L226 Difference]: Without dead ends: 197 [2022-10-15 21:37:14,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=888, Invalid=3402, Unknown=0, NotChecked=0, Total=4290 [2022-10-15 21:37:14,550 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 229 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:37:14,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 281 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:37:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-15 21:37:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2022-10-15 21:37:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.1156462585034013) internal successors, (164), 148 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-10-15 21:37:14,566 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 62 [2022-10-15 21:37:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:37:14,567 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-10-15 21:37:14,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-10-15 21:37:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 21:37:14,568 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:37:14,568 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:37:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-10-15 21:37:14,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 21:37:14,783 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-15 21:37:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:37:14,784 INFO L85 PathProgramCache]: Analyzing trace with hash 377356502, now seen corresponding path program 3 times [2022-10-15 21:37:14,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:37:14,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744556119] [2022-10-15 21:37:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:37:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:37:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:37:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 21:37:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:37:15,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744556119] [2022-10-15 21:37:15,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744556119] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:37:15,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038601194] [2022-10-15 21:37:15,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 21:37:15,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:37:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:37:15,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:37:15,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 21:37:16,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-15 21:37:16,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 21:37:16,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2022-10-15 21:37:16,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:37:16,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 21:37:16,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-10-15 21:37:16,888 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-15 21:37:16,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 21:37:16,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 21:37:17,083 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-15 21:37:17,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 10 [2022-10-15 21:37:17,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 21:37:17,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-15 21:37:17,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 21:37:17,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 21:37:17,447 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-15 21:37:17,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 21:37:17,668 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-15 21:37:17,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 21:37:17,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 21:37:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-10-15 21:37:17,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:37:20,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~data_new~0#1| 1))) (and (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse0)) .cse1)) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))) (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse0)) .cse1)))))) is different from false [2022-10-15 21:37:22,622 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_#t~post9#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse1)))))) (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse1)))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))))) is different from false [2022-10-15 21:37:24,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~data_new~0#1|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse2 .cse3 v_ArrVal_1980)))) (store .cse1 v_subst_1 (store (select .cse1 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse4)))) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse2 .cse3 v_ArrVal_1980)))) (store .cse5 v_subst_2 (store (select .cse5 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse4)))))))) is different from false [2022-10-15 21:37:26,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~data_new~0#1|))) (and (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse4 v_subst_1 (store (select .cse4 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))))) is different from false [2022-10-15 21:37:29,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse0 (+ 3 |c_ULTIMATE.start_main_#t~post9#1|))) (and (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_2 Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse4 v_subst_1 (store (select .cse4 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))))) is different from false [2022-10-15 21:37:29,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 |c_ULTIMATE.start_main_~data_new~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_8 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_8) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse1 v_subst_8 (store (select .cse1 v_subst_8) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse0 v_subst_1 (store (select .cse0 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_7 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse5 v_subst_7 (store (select .cse5 v_subst_7) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse4 v_subst_2 (store (select .cse4 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse7 v_subst_5 (store (select .cse7 v_subst_5) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse6 v_subst_1 (store (select .cse6 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_6 Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse9 v_subst_6 (store (select .cse9 v_subst_6) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse8 v_subst_2 (store (select .cse8 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_6))))) is different from false [2022-10-15 21:37:33,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 21:37:33,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 83 [2022-10-15 21:37:33,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 21:37:33,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 21:37:33,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 21:37:33,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 697 treesize of output 630 [2022-10-15 21:37:33,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 566 [2022-10-15 21:37:33,747 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-15 21:37:33,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2022-10-15 21:37:34,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-10-15 21:37:36,041 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (not (= |c_ULTIMATE.start_main_~len~0#1| 4))) is different from false [2022-10-15 21:37:36,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 21:37:36,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 21:37:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 35 not checked. [2022-10-15 21:37:36,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038601194] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:37:36,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:37:36,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 64 [2022-10-15 21:37:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321966736] [2022-10-15 21:37:36,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:37:36,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-10-15 21:37:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:37:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-10-15 21:37:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2900, Unknown=8, NotChecked=812, Total=4032 [2022-10-15 21:37:36,481 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 64 states, 64 states have (on average 2.390625) internal successors, (153), 64 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:37:38,680 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_main_~len~0#1| 5) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~len~0#1| 4)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2022-10-15 21:37:40,689 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (= |c_ULTIMATE.start_main_~len~0#1| 5) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~len~0#1| 4)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-10-15 21:37:40,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 |c_ULTIMATE.start_main_~data_new~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~len~0#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|)) (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_8 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_8) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse1 v_subst_8 (store (select .cse1 v_subst_8) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse0 v_subst_1 (store (select .cse0 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse2) 1) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_7 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse5 v_subst_7 (store (select .cse5 v_subst_7) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse4 v_subst_2 (store (select .cse4 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse7 v_subst_5 (store (select .cse7 v_subst_5) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse6 v_subst_1 (store (select .cse6 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (= 2 |c_ULTIMATE.start_main_~data_new~0#1|) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_6 Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse9 v_subst_6 (store (select .cse9 v_subst_6) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse8 v_subst_2 (store (select .cse8 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_6))))) is different from false [2022-10-15 21:37:40,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 |c_ULTIMATE.start_main_~data_new~0#1|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~len~0#1| 5) (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|)) (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_8 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_8) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse1 v_subst_8 (store (select .cse1 v_subst_8) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse0 v_subst_1 (store (select .cse0 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse2) 1) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_7 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse5 v_subst_7 (store (select .cse5 v_subst_7) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse4 v_subst_2 (store (select .cse4 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_5 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse7 v_subst_5 (store (select .cse7 v_subst_5) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse6 v_subst_1 (store (select .cse6 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse3)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (= 2 |c_ULTIMATE.start_main_~data_new~0#1|) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (forall ((v_ArrVal_1978 (Array Int Int)) (v_subst_6 Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse3 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1978))) (store .cse9 v_subst_6 (store (select .cse9 v_subst_6) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980))))) (store .cse8 v_subst_2 (store (select .cse8 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_6))))) is different from false [2022-10-15 21:37:43,011 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse0 (+ 3 |c_ULTIMATE.start_main_#t~post9#1|))) (and (= |c_ULTIMATE.start_main_~len~0#1| 5) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_2 Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse2) 1) (= 2 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_1 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse4 v_subst_1 (store (select .cse4 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)))))) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))))) is different from false [2022-10-15 21:37:45,129 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~data_new~0#1|))) (and (= |c_ULTIMATE.start_main_~len~0#1| 5) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse3 v_subst_2 (store (select .cse3 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)))))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse2) 1) (forall ((|ULTIMATE.start_main_~ptr~0#1.base| Int)) (or (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse4 v_subst_1 (store (select .cse4 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (forall ((|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (v_subst_1 Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1980)))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse2)) .cse0)) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))))) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (= 3 |c_ULTIMATE.start_main_~data_new~0#1|))) is different from false [2022-10-15 21:37:47,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~data_new~0#1|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_4 Int) (v_subst_1 Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse2 .cse3 v_ArrVal_1980)))) (store .cse1 v_subst_1 (store (select .cse1 v_subst_1) (+ 4 v_subst_4) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse4)))) (= |c_ULTIMATE.start_main_~head~1#1.offset| v_subst_4))) (= |c_ULTIMATE.start_main_~len~0#1| 5) (or (not (= |c_ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|)) (not (= |c_ULTIMATE.start_main_~head~1#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (forall ((v_ArrVal_1981 Int) (v_ArrVal_1980 Int) (v_subst_3 Int) (v_subst_2 Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.base| v_subst_2) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse2 .cse3 v_ArrVal_1980)))) (store .cse5 v_subst_2 (store (select .cse5 v_subst_2) (+ 4 v_subst_3) v_ArrVal_1981))) |c_ULTIMATE.start_main_~head~1#1.base|) .cse4)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse4) 1) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (= 3 |c_ULTIMATE.start_main_~data_new~0#1|))) is different from false [2022-10-15 21:37:49,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_#t~post9#1|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~len~0#1| 5) (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse1)))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse1) 1) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0) (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= .cse0 (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse1)))) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))) (= 3 |c_ULTIMATE.start_main_#t~post9#1|))) is different from false [2022-10-15 21:37:51,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~1#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~data_new~0#1| 1))) (and (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse0)) .cse1)) (= |ULTIMATE.start_main_~ptr~0#1.base| |c_ULTIMATE.start_main_~head~1#1.base|))) (= |c_ULTIMATE.start_main_~len~0#1| 5) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~1#1.base|) .cse0) 1) (forall ((v_ArrVal_1981 Int) (|ULTIMATE.start_main_~ptr~0#1.base| Int) (|ULTIMATE.start_main_~ptr~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| |ULTIMATE.start_main_~ptr~0#1.offset|) (not (= (+ |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) v_ArrVal_1981)) |c_ULTIMATE.start_main_~head~1#1.base|) .cse0)) .cse1)))) (= 4 |c_ULTIMATE.start_main_~data_new~0#1|) (= |c_ULTIMATE.start_main_~head~1#1.offset| 0))) is different from false