/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-16 14:15:05,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:15:05,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:15:06,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:15:06,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:15:06,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:15:06,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:15:06,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:15:06,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:15:06,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:15:06,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:15:06,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:15:06,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:15:06,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:15:06,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:15:06,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:15:06,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:15:06,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:15:06,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:15:06,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:15:06,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:15:06,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:15:06,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:15:06,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:15:06,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:15:06,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:15:06,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:15:06,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:15:06,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:15:06,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:15:06,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:15:06,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:15:06,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:15:06,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:15:06,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:15:06,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:15:06,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:15:06,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:15:06,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:15:06,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:15:06,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:15:06,082 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-16 14:15:06,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:15:06,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:15:06,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:15:06,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:15:06,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:15:06,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:15:06,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:15:06,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:15:06,134 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:15:06,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:15:06,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:15:06,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:15:06,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:15:06,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:15:06,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:15:06,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:15:06,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:15:06,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:15:06,136 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:15:06,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:15:06,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:15:06,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:15:06,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:15:06,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:15:06,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:15:06,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:15:06,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:15:06,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:15:06,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:15:06,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:15:06,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:15:06,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:15:06,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:15:06,141 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-16 14:15:06,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:15:06,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:15:06,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:15:06,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:15:06,578 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:15:06,580 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-16 14:15:06,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07041bc97/d1e8f818b40f4341b9d902a0ec59c122/FLAG79938e5a7 [2022-10-16 14:15:07,463 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:15:07,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-10-16 14:15:07,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07041bc97/d1e8f818b40f4341b9d902a0ec59c122/FLAG79938e5a7 [2022-10-16 14:15:07,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07041bc97/d1e8f818b40f4341b9d902a0ec59c122 [2022-10-16 14:15:07,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:15:07,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:15:07,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:15:07,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:15:07,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:15:07,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:15:07" (1/1) ... [2022-10-16 14:15:07,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6e13e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:07, skipping insertion in model container [2022-10-16 14:15:07,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:15:07" (1/1) ... [2022-10-16 14:15:07,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:15:07,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:15:08,297 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-16 14:15:08,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:15:08,315 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:15:08,397 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-16 14:15:08,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:15:08,447 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:15:08,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08 WrapperNode [2022-10-16 14:15:08,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:15:08,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:15:08,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:15:08,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:15:08,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,515 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2022-10-16 14:15:08,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:15:08,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:15:08,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:15:08,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:15:08,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,550 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:15:08,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:15:08,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:15:08,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:15:08,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (1/1) ... [2022-10-16 14:15:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:15:08,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:08,597 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-16 14:15:08,619 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-16 14:15:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-16 14:15:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 14:15:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 14:15:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:15:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:15:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:15:08,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:15:08,800 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:15:08,803 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:15:08,854 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-16 14:15:09,122 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:15:09,132 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:15:09,132 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 14:15:09,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:15:09 BoogieIcfgContainer [2022-10-16 14:15:09,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:15:09,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:15:09,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:15:09,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:15:09,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:15:07" (1/3) ... [2022-10-16 14:15:09,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b580c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:15:09, skipping insertion in model container [2022-10-16 14:15:09,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:15:08" (2/3) ... [2022-10-16 14:15:09,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b580c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:15:09, skipping insertion in model container [2022-10-16 14:15:09,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:15:09" (3/3) ... [2022-10-16 14:15:09,146 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-10-16 14:15:09,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:15:09,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-16 14:15:09,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:15:09,240 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;@63a350d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:15:09,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-16 14:15:09,246 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-16 14:15:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 14:15:09,255 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:09,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:15:09,257 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-16 14:15:09,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 620997708, now seen corresponding path program 1 times [2022-10-16 14:15:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874297959] [2022-10-16 14:15:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:09,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:09,798 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-16 14:15:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874297959] [2022-10-16 14:15:09,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874297959] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:09,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:09,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:15:09,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829220764] [2022-10-16 14:15:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:09,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:15:09,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:15:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:15:09,863 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-16 14:15:09,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:09,927 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-10-16 14:15:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:15:09,931 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-16 14:15:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:09,945 INFO L225 Difference]: With dead ends: 65 [2022-10-16 14:15:09,945 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 14:15:09,948 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-16 14:15:09,953 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-16 14:15:09,959 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-16 14:15:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 14:15:10,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-16 14:15:10,012 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-16 14:15:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-16 14:15:10,016 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2022-10-16 14:15:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:10,017 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-16 14:15:10,018 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-16 14:15:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-16 14:15:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 14:15:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:10,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:15:10,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:15:10,020 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-16 14:15:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2071059830, now seen corresponding path program 1 times [2022-10-16 14:15:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:10,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269585755] [2022-10-16 14:15:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:10,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:10,214 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-16 14:15:10,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269585755] [2022-10-16 14:15:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269585755] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:10,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:10,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:15:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239804559] [2022-10-16 14:15:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:10,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:15:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:15:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:15:10,219 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-16 14:15:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:10,251 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-10-16 14:15:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:15:10,254 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-16 14:15:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:10,255 INFO L225 Difference]: With dead ends: 51 [2022-10-16 14:15:10,256 INFO L226 Difference]: Without dead ends: 30 [2022-10-16 14:15:10,256 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-16 14:15:10,260 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-16 14:15:10,263 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-16 14:15:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-16 14:15:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-16 14:15:10,273 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-16 14:15:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-16 14:15:10,275 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 9 [2022-10-16 14:15:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:10,276 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-16 14:15:10,276 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-16 14:15:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-16 14:15:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 14:15:10,281 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:10,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:15:10,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:15:10,281 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-16 14:15:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -491799378, now seen corresponding path program 1 times [2022-10-16 14:15:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:10,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805258067] [2022-10-16 14:15:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:10,429 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-16 14:15:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:10,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805258067] [2022-10-16 14:15:10,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805258067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:10,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:10,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:15:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795449337] [2022-10-16 14:15:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:10,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:15:10,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:15:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:15:10,434 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-16 14:15:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:10,479 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-10-16 14:15:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:15:10,480 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-16 14:15:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:10,481 INFO L225 Difference]: With dead ends: 36 [2022-10-16 14:15:10,481 INFO L226 Difference]: Without dead ends: 34 [2022-10-16 14:15:10,482 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-16 14:15:10,484 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-16 14:15:10,485 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-16 14:15:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-16 14:15:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-16 14:15:10,491 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-16 14:15:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-10-16 14:15:10,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 15 [2022-10-16 14:15:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:10,493 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-10-16 14:15:10,493 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-16 14:15:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-10-16 14:15:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 14:15:10,494 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:10,495 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-16 14:15:10,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:15:10,495 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-16 14:15:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1061738802, now seen corresponding path program 1 times [2022-10-16 14:15:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:10,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726825915] [2022-10-16 14:15:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:10,697 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-16 14:15:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726825915] [2022-10-16 14:15:10,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726825915] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:10,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:10,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:15:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141731190] [2022-10-16 14:15:10,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:10,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:15:10,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:15:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:15:10,707 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-16 14:15:10,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:10,837 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-10-16 14:15:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:15:10,838 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-16 14:15:10,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:10,841 INFO L225 Difference]: With dead ends: 50 [2022-10-16 14:15:10,841 INFO L226 Difference]: Without dead ends: 49 [2022-10-16 14:15:10,843 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-16 14:15:10,855 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-16 14:15:10,856 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-16 14:15:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-16 14:15:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-10-16 14:15:10,872 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-16 14:15:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-10-16 14:15:10,875 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2022-10-16 14:15:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:10,876 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-10-16 14:15:10,876 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-16 14:15:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-10-16 14:15:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 14:15:10,878 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:10,878 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-16 14:15:10,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 14:15:10,879 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-16 14:15:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1445835604, now seen corresponding path program 1 times [2022-10-16 14:15:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:10,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950855597] [2022-10-16 14:15:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:11,186 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-16 14:15:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:11,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950855597] [2022-10-16 14:15:11,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950855597] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696674190] [2022-10-16 14:15:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:11,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:11,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:11,199 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-16 14:15:11,219 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-16 14:15:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:11,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-16 14:15:11,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:11,460 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-16 14:15:11,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:11,543 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-16 14:15:11,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696674190] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:11,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:11,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-16 14:15:11,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752086888] [2022-10-16 14:15:11,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:11,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 14:15:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:11,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 14:15:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:15:11,551 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-16 14:15:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:11,628 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-10-16 14:15:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:15:11,630 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-16 14:15:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:11,639 INFO L225 Difference]: With dead ends: 72 [2022-10-16 14:15:11,639 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 14:15:11,640 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-16 14:15:11,643 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-16 14:15:11,645 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-16 14:15:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 14:15:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-16 14:15:11,659 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-16 14:15:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-10-16 14:15:11,660 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 19 [2022-10-16 14:15:11,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:11,663 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-10-16 14:15:11,663 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-16 14:15:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-10-16 14:15:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 14:15:11,665 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:11,665 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-16 14:15:11,709 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-16 14:15:11,881 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-16 14:15:11,882 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-16 14:15:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:11,884 INFO L85 PathProgramCache]: Analyzing trace with hash -864257004, now seen corresponding path program 2 times [2022-10-16 14:15:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:11,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880058742] [2022-10-16 14:15:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:12,129 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-16 14:15:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:12,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880058742] [2022-10-16 14:15:12,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880058742] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:12,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041064867] [2022-10-16 14:15:12,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:15:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:12,132 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-16 14:15:12,142 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-16 14:15:12,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 14:15:12,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:15:12,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 14:15:12,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:12,364 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-16 14:15:12,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:15:12,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041064867] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:12,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:15:12,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-10-16 14:15:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224568941] [2022-10-16 14:15:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:12,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 14:15:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 14:15:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-10-16 14:15:12,367 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-16 14:15:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:12,425 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-10-16 14:15:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:15:12,426 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-16 14:15:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:12,427 INFO L225 Difference]: With dead ends: 46 [2022-10-16 14:15:12,427 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 14:15:12,427 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-16 14:15:12,428 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-16 14:15:12,429 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-16 14:15:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 14:15:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-16 14:15:12,435 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-16 14:15:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-10-16 14:15:12,436 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2022-10-16 14:15:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:12,436 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-10-16 14:15:12,437 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-16 14:15:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-10-16 14:15:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 14:15:12,438 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:12,438 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-16 14:15:12,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:15:12,651 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-16 14:15:12,652 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-16 14:15:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1022123430, now seen corresponding path program 1 times [2022-10-16 14:15:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706205184] [2022-10-16 14:15:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:12,817 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-16 14:15:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:12,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706205184] [2022-10-16 14:15:12,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706205184] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824907925] [2022-10-16 14:15:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:12,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:12,819 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-16 14:15:12,841 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-16 14:15:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:12,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 14:15:12,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:13,048 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-16 14:15:13,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:13,143 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-16 14:15:13,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824907925] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:13,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:13,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 13 [2022-10-16 14:15:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740774105] [2022-10-16 14:15:13,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:13,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-16 14:15:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:13,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-16 14:15:13,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-10-16 14:15:13,146 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-16 14:15:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:13,297 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-10-16 14:15:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 14:15:13,297 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-16 14:15:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:13,298 INFO L225 Difference]: With dead ends: 78 [2022-10-16 14:15:13,298 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 14:15:13,299 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-16 14:15:13,300 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-16 14:15:13,300 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-16 14:15:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 14:15:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-10-16 14:15:13,307 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-16 14:15:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-10-16 14:15:13,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2022-10-16 14:15:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:13,309 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-10-16 14:15:13,309 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-16 14:15:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-10-16 14:15:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-16 14:15:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:13,310 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-16 14:15:13,345 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-16 14:15:13,519 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-16 14:15:13,520 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-16 14:15:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash 556444902, now seen corresponding path program 1 times [2022-10-16 14:15:13,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:13,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459949413] [2022-10-16 14:15:13,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:13,746 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-16 14:15:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459949413] [2022-10-16 14:15:13,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459949413] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:13,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:13,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:15:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680155445] [2022-10-16 14:15:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:13,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:15:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:15:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:15:13,753 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-16 14:15:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:13,886 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-10-16 14:15:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 14:15:13,887 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-16 14:15:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:13,888 INFO L225 Difference]: With dead ends: 67 [2022-10-16 14:15:13,888 INFO L226 Difference]: Without dead ends: 66 [2022-10-16 14:15:13,888 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-16 14:15:13,889 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-16 14:15:13,890 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-16 14:15:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-16 14:15:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-10-16 14:15:13,896 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-16 14:15:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-10-16 14:15:13,897 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-10-16 14:15:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-10-16 14:15:13,898 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-16 14:15:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-10-16 14:15:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 14:15:13,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:13,900 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-16 14:15:13,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 14:15:13,900 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-16 14:15:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:13,901 INFO L85 PathProgramCache]: Analyzing trace with hash 69922889, now seen corresponding path program 1 times [2022-10-16 14:15:13,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:13,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070353314] [2022-10-16 14:15:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:13,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:14,204 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-16 14:15:14,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070353314] [2022-10-16 14:15:14,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070353314] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:14,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:15:14,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 14:15:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260460214] [2022-10-16 14:15:14,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:14,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:15:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:14,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:15:14,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:15:14,207 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-16 14:15:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:14,320 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-10-16 14:15:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 14:15:14,321 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-16 14:15:14,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:14,322 INFO L225 Difference]: With dead ends: 64 [2022-10-16 14:15:14,322 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 14:15:14,323 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-16 14:15:14,326 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-16 14:15:14,326 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-16 14:15:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 14:15:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-10-16 14:15:14,355 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-16 14:15:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-10-16 14:15:14,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 38 [2022-10-16 14:15:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:14,356 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-10-16 14:15:14,357 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-16 14:15:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-10-16 14:15:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-16 14:15:14,362 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:14,362 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-16 14:15:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 14:15:14,363 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-16 14:15:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1256059568, now seen corresponding path program 1 times [2022-10-16 14:15:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:14,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784546444] [2022-10-16 14:15:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:14,572 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-16 14:15:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784546444] [2022-10-16 14:15:14,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784546444] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140495280] [2022-10-16 14:15:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:14,574 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-16 14:15:14,596 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-16 14:15:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:14,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 14:15:14,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:14,863 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-16 14:15:14,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:14,976 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-16 14:15:14,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140495280] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:14,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:14,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-10-16 14:15:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591858635] [2022-10-16 14:15:14,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:14,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 14:15:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:14,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 14:15:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-10-16 14:15:14,979 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-16 14:15:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:15,174 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-10-16 14:15:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 14:15:15,175 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-16 14:15:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:15,178 INFO L225 Difference]: With dead ends: 83 [2022-10-16 14:15:15,178 INFO L226 Difference]: Without dead ends: 82 [2022-10-16 14:15:15,179 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-16 14:15:15,180 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-16 14:15:15,182 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-16 14:15:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-16 14:15:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2022-10-16 14:15:15,192 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-16 14:15:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-10-16 14:15:15,195 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 38 [2022-10-16 14:15:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:15,195 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-10-16 14:15:15,195 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-16 14:15:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-10-16 14:15:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 14:15:15,197 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:15,198 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-16 14:15:15,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 14:15:15,411 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-16 14:15:15,412 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-16 14:15:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash 187477628, now seen corresponding path program 2 times [2022-10-16 14:15:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177368736] [2022-10-16 14:15:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:15,634 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-16 14:15:15,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:15,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177368736] [2022-10-16 14:15:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177368736] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036702711] [2022-10-16 14:15:15,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:15:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:15,636 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-16 14:15:15,659 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-16 14:15:15,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:15:15,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:15:15,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 14:15:15,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:15,842 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-16 14:15:15,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:15,909 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-16 14:15:15,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036702711] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:15,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:15,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-10-16 14:15:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357705644] [2022-10-16 14:15:15,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:15,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 14:15:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 14:15:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-10-16 14:15:15,914 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-16 14:15:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:16,051 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-10-16 14:15:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 14:15:16,052 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-16 14:15:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:16,057 INFO L225 Difference]: With dead ends: 90 [2022-10-16 14:15:16,057 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 14:15:16,058 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-16 14:15:16,059 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-16 14:15:16,059 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-16 14:15:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 14:15:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-10-16 14:15:16,081 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-16 14:15:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-10-16 14:15:16,082 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 40 [2022-10-16 14:15:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:16,083 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-10-16 14:15:16,084 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-16 14:15:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-10-16 14:15:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 14:15:16,090 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:16,090 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-16 14:15:16,133 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-16 14:15:16,308 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-16 14:15:16,309 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-16 14:15:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash 426663804, now seen corresponding path program 1 times [2022-10-16 14:15:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688263208] [2022-10-16 14:15:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:16,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:16,654 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-16 14:15:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688263208] [2022-10-16 14:15:16,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688263208] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:16,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311278802] [2022-10-16 14:15:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:16,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:16,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:16,656 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-16 14:15:16,678 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-16 14:15:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:16,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 14:15:16,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:16,932 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-16 14:15:16,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:17,054 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-16 14:15:17,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311278802] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:17,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-10-16 14:15:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15155398] [2022-10-16 14:15:17,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:17,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 14:15:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:17,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 14:15:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-10-16 14:15:17,057 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-16 14:15:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:17,426 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-10-16 14:15:17,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 14:15:17,427 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-16 14:15:17,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:17,428 INFO L225 Difference]: With dead ends: 108 [2022-10-16 14:15:17,428 INFO L226 Difference]: Without dead ends: 107 [2022-10-16 14:15:17,429 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-16 14:15:17,429 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-16 14:15:17,430 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-16 14:15:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-16 14:15:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-10-16 14:15:17,438 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-16 14:15:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-10-16 14:15:17,439 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 42 [2022-10-16 14:15:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:17,439 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-10-16 14:15:17,440 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-16 14:15:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-10-16 14:15:17,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 14:15:17,440 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:17,441 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-16 14:15:17,482 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-16 14:15:17,656 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-16 14:15:17,657 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-16 14:15:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash 502478809, now seen corresponding path program 1 times [2022-10-16 14:15:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:17,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230743440] [2022-10-16 14:15:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:17,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:17,905 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-16 14:15:17,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:17,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230743440] [2022-10-16 14:15:17,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230743440] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:17,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940648067] [2022-10-16 14:15:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:17,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:17,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:17,907 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-16 14:15:17,910 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-16 14:15:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:18,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 14:15:18,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:18,209 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-16 14:15:18,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:15:18,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940648067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:15:18,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:15:18,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2022-10-16 14:15:18,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903444265] [2022-10-16 14:15:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:15:18,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 14:15:18,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 14:15:18,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-10-16 14:15:18,213 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-16 14:15:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:18,330 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-10-16 14:15:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 14:15:18,331 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-16 14:15:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:18,332 INFO L225 Difference]: With dead ends: 104 [2022-10-16 14:15:18,332 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 14:15:18,333 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-16 14:15:18,334 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-16 14:15:18,334 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-16 14:15:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 14:15:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2022-10-16 14:15:18,341 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-16 14:15:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2022-10-16 14:15:18,342 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 43 [2022-10-16 14:15:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:18,342 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2022-10-16 14:15:18,343 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-16 14:15:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2022-10-16 14:15:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 14:15:18,343 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:18,343 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-16 14:15:18,387 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-16 14:15:18,557 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-16 14:15:18,558 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-16 14:15:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1064823530, now seen corresponding path program 1 times [2022-10-16 14:15:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922150738] [2022-10-16 14:15:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:18,889 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-16 14:15:18,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:18,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922150738] [2022-10-16 14:15:18,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922150738] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:18,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295908367] [2022-10-16 14:15:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:18,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:18,891 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-16 14:15:18,904 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-16 14:15:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:19,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-16 14:15:19,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:19,231 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-16 14:15:19,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:19,518 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-16 14:15:19,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295908367] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:19,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:19,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2022-10-16 14:15:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835045006] [2022-10-16 14:15:19,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:19,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 14:15:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:19,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 14:15:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2022-10-16 14:15:19,521 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-16 14:15:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:20,058 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-10-16 14:15:20,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 14:15:20,059 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-16 14:15:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:20,060 INFO L225 Difference]: With dead ends: 129 [2022-10-16 14:15:20,060 INFO L226 Difference]: Without dead ends: 128 [2022-10-16 14:15:20,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 14:15:20,062 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-16 14:15:20,063 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-16 14:15:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-10-16 14:15:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2022-10-16 14:15:20,072 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-16 14:15:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-10-16 14:15:20,072 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 52 [2022-10-16 14:15:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:20,073 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-10-16 14:15:20,073 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-16 14:15:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-10-16 14:15:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 14:15:20,074 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:20,074 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-16 14:15:20,115 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-16 14:15:20,287 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-16 14:15:20,288 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-16 14:15:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:20,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1889247868, now seen corresponding path program 3 times [2022-10-16 14:15:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:20,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489231955] [2022-10-16 14:15:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:20,693 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-16 14:15:20,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489231955] [2022-10-16 14:15:20,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489231955] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280747759] [2022-10-16 14:15:20,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 14:15:20,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:20,698 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-16 14:15:20,718 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-16 14:15:25,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 14:15:25,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:15:25,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 14:15:25,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:25,722 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-16 14:15:25,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:26,015 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-16 14:15:26,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280747759] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:26,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:26,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2022-10-16 14:15:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731651806] [2022-10-16 14:15:26,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:26,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 14:15:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 14:15:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2022-10-16 14:15:26,018 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-16 14:15:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:26,362 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2022-10-16 14:15:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 14:15:26,362 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-16 14:15:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:26,364 INFO L225 Difference]: With dead ends: 165 [2022-10-16 14:15:26,364 INFO L226 Difference]: Without dead ends: 164 [2022-10-16 14:15:26,365 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-16 14:15:26,366 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-16 14:15:26,366 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-16 14:15:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-10-16 14:15:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2022-10-16 14:15:26,378 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-16 14:15:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-10-16 14:15:26,379 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 60 [2022-10-16 14:15:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:26,379 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-10-16 14:15:26,380 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-16 14:15:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-10-16 14:15:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-16 14:15:26,380 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:26,381 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-16 14:15:26,433 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-16 14:15:26,595 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-16 14:15:26,596 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-16 14:15:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1154450364, now seen corresponding path program 2 times [2022-10-16 14:15:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412152427] [2022-10-16 14:15:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:27,102 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-16 14:15:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:27,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412152427] [2022-10-16 14:15:27,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412152427] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:27,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250124626] [2022-10-16 14:15:27,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:15:27,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:27,105 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-16 14:15:27,127 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-16 14:15:27,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:15:27,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:15:27,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-16 14:15:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:27,525 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-16 14:15:27,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:27,856 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-16 14:15:27,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250124626] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:27,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:27,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 40 [2022-10-16 14:15:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139422092] [2022-10-16 14:15:27,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:27,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 14:15:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:27,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 14:15:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2022-10-16 14:15:27,860 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-16 14:15:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:15:28,518 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2022-10-16 14:15:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 14:15:28,519 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-16 14:15:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:15:28,521 INFO L225 Difference]: With dead ends: 198 [2022-10-16 14:15:28,521 INFO L226 Difference]: Without dead ends: 197 [2022-10-16 14:15:28,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=888, Invalid=3402, Unknown=0, NotChecked=0, Total=4290 [2022-10-16 14:15:28,524 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 229 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 14:15:28,524 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-16 14:15:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-10-16 14:15:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2022-10-16 14:15:28,558 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-16 14:15:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-10-16 14:15:28,559 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 62 [2022-10-16 14:15:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:15:28,559 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-10-16 14:15:28,559 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-16 14:15:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-10-16 14:15:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 14:15:28,560 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:15:28,560 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-16 14:15:28,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 14:15:28,775 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-16 14:15:28,776 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-16 14:15:28,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:15:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 377356502, now seen corresponding path program 3 times [2022-10-16 14:15:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:15:28,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898682219] [2022-10-16 14:15:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:15:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:15:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:15:29,466 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-16 14:15:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:15:29,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898682219] [2022-10-16 14:15:29,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898682219] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:15:29,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579417541] [2022-10-16 14:15:29,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 14:15:29,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:15:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:15:29,469 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-16 14:15:29,496 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-16 14:15:30,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 14:15:30,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:15:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2022-10-16 14:15:30,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:15:31,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:15:31,018 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-16 14:15:31,107 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 14:15:31,108 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-16 14:15:31,118 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-16 14:15:31,322 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 14:15:31,323 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-16 14:15:31,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:15:31,334 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-16 14:15:31,340 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-16 14:15:31,525 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-16 14:15:31,714 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-16 14:15:31,714 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-16 14:15:31,914 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-10-16 14:15:31,915 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-16 14:15:32,114 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-16 14:15:32,148 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-16 14:15:32,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:15:34,772 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-16 14:15:36,809 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-16 14:15:38,874 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-16 14:15:41,047 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-16 14:15:43,202 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-16 14:15:43,456 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-16 14:15:47,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:15:47,650 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-16 14:15:47,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:15:47,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:15:47,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2345 treesize of output 2313 [2022-10-16 14:15:47,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:15:47,770 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 2362 treesize of output 2198 [2022-10-16 14:15:48,284 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 8 treesize of output 4 [2022-10-16 14:15:48,452 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 8 treesize of output 4 [2022-10-16 14:15:48,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 14:15:48,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 34 [2022-10-16 14:15:48,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:15:48,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:15:48,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-10-16 14:15:48,628 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 14:15:48,628 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-16 14:15:48,645 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 14:15:48,645 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-16 14:15:48,993 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-16 14:15:51,026 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-16 14:15:51,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:15:51,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 14:15:51,538 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-16 14:15:51,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579417541] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:15:51,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:15:51,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 64 [2022-10-16 14:15:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068539907] [2022-10-16 14:15:51,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:15:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-10-16 14:15:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:15:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-10-16 14:15:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2899, Unknown=9, NotChecked=812, Total=4032 [2022-10-16 14:15:51,544 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-16 14:15:53,788 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-16 14:15:55,792 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-16 14:15:56,000 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-16 14:15:56,049 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-16 14:15:58,167 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-16 14:16:00,296 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-16 14:16:02,309 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-16 14:16:04,334 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-16 14:16:06,407 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 [2022-10-16 14:16:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:16:09,640 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2022-10-16 14:16:09,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-16 14:16:09,641 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 72 [2022-10-16 14:16:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:16:09,642 INFO L225 Difference]: With dead ends: 229 [2022-10-16 14:16:09,642 INFO L226 Difference]: Without dead ends: 179 [2022-10-16 14:16:09,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=523, Invalid=4493, Unknown=18, NotChecked=2448, Total=7482 [2022-10-16 14:16:09,647 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 14:16:09,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 185 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 624 Invalid, 0 Unknown, 473 Unchecked, 0.8s Time] [2022-10-16 14:16:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-16 14:16:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 149. [2022-10-16 14:16:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.1020408163265305) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 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-16 14:16:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-10-16 14:16:09,665 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 72 [2022-10-16 14:16:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:16:09,665 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-10-16 14:16:09,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-16 14:16:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-10-16 14:16:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 14:16:09,667 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:16:09,667 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:16:09,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-10-16 14:16:09,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 14:16:09,881 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 14:16:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:16:09,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1251974042, now seen corresponding path program 4 times [2022-10-16 14:16:09,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:16:09,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685642129] [2022-10-16 14:16:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:16:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:16:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:16:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:16:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685642129] [2022-10-16 14:16:10,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685642129] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:16:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714815109] [2022-10-16 14:16:10,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 14:16:10,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:16:10,997 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:16:11,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 14:16:12,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 14:16:12,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:16:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 14:16:12,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:16:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:12,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:16:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714815109] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:16:13,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:16:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 56 [2022-10-16 14:16:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821646546] [2022-10-16 14:16:13,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:16:13,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 14:16:13,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:16:13,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 14:16:13,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=2667, Unknown=0, NotChecked=0, Total=3192 [2022-10-16 14:16:13,852 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 57 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 57 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-16 14:16:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:16:15,721 INFO L93 Difference]: Finished difference Result 229 states and 247 transitions. [2022-10-16 14:16:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 14:16:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 57 states have internal predecessors, (151), 0 states have call successors, (0), 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 77 [2022-10-16 14:16:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:16:15,724 INFO L225 Difference]: With dead ends: 229 [2022-10-16 14:16:15,724 INFO L226 Difference]: Without dead ends: 228 [2022-10-16 14:16:15,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1535, Invalid=6475, Unknown=0, NotChecked=0, Total=8010 [2022-10-16 14:16:15,728 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 423 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:16:15,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 290 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:16:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-16 14:16:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 159. [2022-10-16 14:16:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.0955414012738853) internal successors, (172), 158 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-16 14:16:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2022-10-16 14:16:15,745 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 77 [2022-10-16 14:16:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:16:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2022-10-16 14:16:15,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 57 states have internal predecessors, (151), 0 states have call successors, (0), 0 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-16 14:16:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2022-10-16 14:16:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 14:16:15,746 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:16:15,747 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:16:15,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 14:16:15,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 14:16:15,948 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 14:16:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:16:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 499550092, now seen corresponding path program 5 times [2022-10-16 14:16:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:16:15,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794761033] [2022-10-16 14:16:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:16:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:16:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:16:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:16:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794761033] [2022-10-16 14:16:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794761033] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:16:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317016044] [2022-10-16 14:16:17,144 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 14:16:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:16:17,146 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:16:17,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 14:16:19,315 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-10-16 14:16:19,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:16:19,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 14:16:19,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:16:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:20,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:16:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:21,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317016044] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:16:21,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:16:21,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 66 [2022-10-16 14:16:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239294354] [2022-10-16 14:16:21,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:16:21,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-10-16 14:16:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:16:21,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-10-16 14:16:21,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=3709, Unknown=0, NotChecked=0, Total=4422 [2022-10-16 14:16:21,490 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand has 67 states, 66 states have (on average 2.6666666666666665) internal successors, (176), 67 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-16 14:16:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:16:23,898 INFO L93 Difference]: Finished difference Result 287 states and 306 transitions. [2022-10-16 14:16:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-16 14:16:23,898 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.6666666666666665) internal successors, (176), 67 states have internal predecessors, (176), 0 states have call successors, (0), 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 87 [2022-10-16 14:16:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:16:23,900 INFO L225 Difference]: With dead ends: 287 [2022-10-16 14:16:23,900 INFO L226 Difference]: Without dead ends: 286 [2022-10-16 14:16:23,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4153 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2162, Invalid=9180, Unknown=0, NotChecked=0, Total=11342 [2022-10-16 14:16:23,906 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 608 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:16:23,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 408 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:16:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-10-16 14:16:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 171. [2022-10-16 14:16:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.0887573964497042) internal successors, (184), 170 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-16 14:16:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 184 transitions. [2022-10-16 14:16:23,929 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 184 transitions. Word has length 87 [2022-10-16 14:16:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:16:23,929 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 184 transitions. [2022-10-16 14:16:23,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.6666666666666665) internal successors, (176), 67 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-16 14:16:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 184 transitions. [2022-10-16 14:16:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-10-16 14:16:23,931 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:16:23,931 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:16:23,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-10-16 14:16:24,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:24,145 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 14:16:24,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:16:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2018261030, now seen corresponding path program 6 times [2022-10-16 14:16:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:16:24,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668620791] [2022-10-16 14:16:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:16:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:16:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:16:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:25,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:16:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668620791] [2022-10-16 14:16:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668620791] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:16:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079473165] [2022-10-16 14:16:25,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 14:16:25,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:16:25,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:16:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 14:16:28,140 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-10-16 14:16:28,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:16:28,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-16 14:16:28,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:16:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:29,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:16:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:30,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079473165] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:16:30,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:16:30,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 76 [2022-10-16 14:16:30,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619267186] [2022-10-16 14:16:30,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:16:30,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-10-16 14:16:30,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:16:30,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-10-16 14:16:30,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=4923, Unknown=0, NotChecked=0, Total=5852 [2022-10-16 14:16:30,795 INFO L87 Difference]: Start difference. First operand 171 states and 184 transitions. Second operand has 77 states, 76 states have (on average 2.6447368421052633) internal successors, (201), 77 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-16 14:16:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:16:33,823 INFO L93 Difference]: Finished difference Result 331 states and 352 transitions. [2022-10-16 14:16:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-10-16 14:16:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.6447368421052633) internal successors, (201), 77 states have internal predecessors, (201), 0 states have call successors, (0), 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 97 [2022-10-16 14:16:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:16:33,828 INFO L225 Difference]: With dead ends: 331 [2022-10-16 14:16:33,829 INFO L226 Difference]: Without dead ends: 330 [2022-10-16 14:16:33,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5966 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3037, Invalid=12965, Unknown=0, NotChecked=0, Total=16002 [2022-10-16 14:16:33,838 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 576 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:16:33,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 370 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:16:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-10-16 14:16:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 183. [2022-10-16 14:16:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.0883977900552486) internal successors, (197), 182 states have internal predecessors, (197), 0 states have call successors, (0), 0 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-16 14:16:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 197 transitions. [2022-10-16 14:16:33,898 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 197 transitions. Word has length 97 [2022-10-16 14:16:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:16:33,898 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 197 transitions. [2022-10-16 14:16:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.6447368421052633) internal successors, (201), 77 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-16 14:16:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 197 transitions. [2022-10-16 14:16:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-16 14:16:33,900 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:16:33,900 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:16:33,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 14:16:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:34,115 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-10-16 14:16:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:16:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 628329084, now seen corresponding path program 4 times [2022-10-16 14:16:34,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:16:34,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665554508] [2022-10-16 14:16:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:16:34,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:16:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:16:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-16 14:16:35,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:16:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665554508] [2022-10-16 14:16:35,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665554508] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:16:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124180416] [2022-10-16 14:16:35,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 14:16:35,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:16:35,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:16:35,555 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:16:35,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 14:16:35,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 14:16:35,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:16:35,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 142 conjunts are in the unsatisfiable core [2022-10-16 14:16:35,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:16:35,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-10-16 14:16:36,044 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 14:16:36,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-16 14:16:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-16 14:16:36,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-16 14:16:36,349 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-10-16 14:16:36,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-10-16 14:16:36,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-10-16 14:16:36,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-10-16 14:16:36,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,790 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-10-16 14:16:36,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-10-16 14:16:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,984 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-10-16 14:16:36,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 52 [2022-10-16 14:16:36,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:36,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:37,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2022-10-16 14:16:37,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:37,439 INFO L356 Elim1Store]: treesize reduction 48, result has 48.9 percent of original size [2022-10-16 14:16:37,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 93 [2022-10-16 14:16:37,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:16:37,495 INFO L356 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2022-10-16 14:16:37,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2022-10-16 14:16:40,816 INFO L356 Elim1Store]: treesize reduction 216, result has 34.5 percent of original size [2022-10-16 14:16:40,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 241 treesize of output 234 [2022-10-16 14:16:41,156 INFO L356 Elim1Store]: treesize reduction 312, result has 26.9 percent of original size [2022-10-16 14:16:41,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 172 treesize of output 249 [2022-10-16 14:17:04,067 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 250 DAG size of output: 105 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:17:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:17:08,082 INFO L356 Elim1Store]: treesize reduction 1144, result has 0.1 percent of original size [2022-10-16 14:17:08,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 372 treesize of output 384 [2022-10-16 14:17:08,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:17:08,123 INFO L356 Elim1Store]: treesize reduction 528, result has 0.2 percent of original size [2022-10-16 14:17:08,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 357 treesize of output 254 [2022-10-16 14:17:12,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 14:17:12,686 INFO L356 Elim1Store]: treesize reduction 288, result has 0.3 percent of original size [2022-10-16 14:17:12,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 44 case distinctions, treesize of input 310 treesize of output 231 [2022-10-16 14:17:12,944 INFO L356 Elim1Store]: treesize reduction 992, result has 9.2 percent of original size [2022-10-16 14:17:12,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 50 case distinctions, treesize of input 284 treesize of output 282 [2022-10-16 14:17:13,933 INFO L356 Elim1Store]: treesize reduction 347, result has 12.6 percent of original size [2022-10-16 14:17:13,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 28 case distinctions, treesize of input 327 treesize of output 198 [2022-10-16 14:17:14,084 INFO L356 Elim1Store]: treesize reduction 420, result has 10.6 percent of original size [2022-10-16 14:17:14,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 313 treesize of output 233 [2022-10-16 14:17:14,880 INFO L356 Elim1Store]: treesize reduction 296, result has 13.7 percent of original size [2022-10-16 14:17:14,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 416 treesize of output 175 [2022-10-16 14:17:15,002 INFO L356 Elim1Store]: treesize reduction 316, result has 12.0 percent of original size [2022-10-16 14:17:15,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 338 treesize of output 210 [2022-10-16 14:17:15,619 INFO L356 Elim1Store]: treesize reduction 259, result has 15.1 percent of original size [2022-10-16 14:17:15,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 17 new quantified variables, introduced 28 case distinctions, treesize of input 366 treesize of output 158 [2022-10-16 14:17:15,653 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-10-16 14:17:15,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 34 [2022-10-16 14:17:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 240 proven. 84 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-10-16 14:17:15,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:18:14,670 WARN L233 SmtUtils]: Spent 27.64s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:19:06,566 WARN L233 SmtUtils]: Spent 26.08s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:19:10,574 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (.cse19 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse13 (select .cse21 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) (or (let ((.cse16 (+ .cse13 4)) (.cse20 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (and (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse12 (select .cse14 .cse15)) (.cse18 (select .cse17 .cse15))) (let ((.cse10 (select .cse18 .cse13)) (.cse11 (store .cse17 .cse15 (store .cse18 .cse16 v_ArrVal_2978))) (.cse6 (store .cse14 .cse15 (store .cse12 .cse16 v_ArrVal_2979))) (.cse1 (select .cse12 .cse13))) (let ((.cse7 (select .cse6 .cse1)) (.cse9 (select .cse11 .cse1)) (.cse8 (+ 4 .cse10))) (let ((.cse3 (store .cse11 .cse1 (store .cse9 .cse8 v_ArrVal_2984))) (.cse2 (select .cse7 .cse10))) (let ((.cse4 (select .cse3 .cse2)) (.cse5 (select .cse9 .cse10))) (let ((.cse0 (select .cse4 .cse5))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse0) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse1) (= .cse2 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store .cse3 .cse2 (store .cse4 (+ .cse5 4) v_ArrVal_2987)) (select (select (store .cse6 .cse1 (store .cse7 .cse8 v_ArrVal_2985)) .cse2) .cse5)) .cse0))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse36 (select .cse37 .cse15)) (.cse35 (select .cse34 .cse15))) (let ((.cse31 (select .cse35 .cse13)) (.cse33 (store .cse37 .cse15 (store .cse36 .cse16 v_ArrVal_2979))) (.cse23 (select .cse36 .cse13))) (let ((.cse32 (select .cse33 .cse23)) (.cse30 (+ 4 .cse31)) (.cse28 (store .cse34 .cse15 (store .cse35 .cse16 v_ArrVal_2978)))) (let ((.cse29 (select .cse28 .cse23)) (.cse25 (store .cse33 .cse23 (store .cse32 .cse30 v_ArrVal_2985))) (.cse26 (select .cse32 .cse31))) (let ((.cse27 (select .cse25 .cse26)) (.cse24 (select .cse29 .cse31))) (let ((.cse22 (select .cse27 .cse24))) (or (= .cse22 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse23) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse24) (= (select (select (store .cse25 .cse26 (store .cse27 (+ .cse24 4) v_ArrVal_2989)) .cse22) (select (select (store .cse28 .cse23 (store .cse29 .cse30 v_ArrVal_2984)) .cse26) .cse24)) |c_ULTIMATE.start_main_~head~1#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse52 (select .cse53 .cse15)) (.cse51 (select .cse50 .cse15))) (let ((.cse47 (select .cse51 .cse13)) (.cse49 (store .cse53 .cse15 (store .cse52 .cse16 v_ArrVal_2979))) (.cse44 (select .cse52 .cse13))) (let ((.cse48 (select .cse49 .cse44)) (.cse46 (+ 4 .cse47)) (.cse43 (store .cse50 .cse15 (store .cse51 .cse16 v_ArrVal_2978)))) (let ((.cse45 (select .cse43 .cse44)) (.cse40 (store .cse49 .cse44 (store .cse48 .cse46 v_ArrVal_2985))) (.cse41 (select .cse48 .cse47))) (let ((.cse42 (select .cse40 .cse41)) (.cse39 (select .cse45 .cse47))) (let ((.cse38 (select .cse42 .cse39))) (or (= .cse38 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse39) (= (select (select (store .cse40 .cse41 (store .cse42 (+ .cse39 4) v_ArrVal_2989)) .cse38) (select (select (store .cse43 .cse44 (store .cse45 .cse46 v_ArrVal_2984)) .cse41) .cse39)) |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse47)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse68 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse66 (select .cse68 .cse15)) (.cse67 (select .cse69 .cse15))) (let ((.cse63 (store .cse69 .cse15 (store .cse67 .cse16 v_ArrVal_2979))) (.cse60 (store .cse68 .cse15 (store .cse66 .cse16 v_ArrVal_2978))) (.cse55 (select .cse67 .cse13))) (let ((.cse61 (select .cse60 .cse55)) (.cse64 (select .cse63 .cse55)) (.cse65 (select .cse66 .cse13))) (let ((.cse62 (+ 4 .cse65)) (.cse58 (select .cse64 .cse65)) (.cse56 (select .cse61 .cse65))) (let ((.cse54 (select (select (store .cse63 .cse55 (store .cse64 .cse62 v_ArrVal_2985)) .cse58) .cse56))) (or (= .cse54 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse55) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse56) (= |c_ULTIMATE.start_main_~head~1#1.offset| (let ((.cse57 (store .cse60 .cse55 (store .cse61 .cse62 v_ArrVal_2984)))) (let ((.cse59 (select .cse57 .cse58))) (select (select (store .cse57 .cse58 (store .cse59 (+ .cse56 4) v_ArrVal_2987)) .cse54) (select .cse59 .cse56))))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse82 (select .cse83 .cse15)) (.cse85 (select .cse84 .cse15))) (let ((.cse72 (select .cse85 .cse13)) (.cse81 (store .cse84 .cse15 (store .cse85 .cse16 v_ArrVal_2978))) (.cse76 (store .cse83 .cse15 (store .cse82 .cse16 v_ArrVal_2979))) (.cse77 (select .cse82 .cse13))) (let ((.cse78 (select .cse76 .cse77)) (.cse80 (select .cse81 .cse77)) (.cse79 (+ 4 .cse72))) (let ((.cse73 (store .cse81 .cse77 (store .cse80 .cse79 v_ArrVal_2984))) (.cse71 (select .cse78 .cse72))) (let ((.cse74 (select .cse73 .cse71)) (.cse75 (select .cse80 .cse72))) (let ((.cse70 (select .cse74 .cse75))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse70) (= .cse71 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse72) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store .cse73 .cse71 (store .cse74 (+ .cse75 4) v_ArrVal_2987)) (select (select (store .cse76 .cse77 (store .cse78 .cse79 v_ArrVal_2985)) .cse71) .cse75)) .cse70))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse100 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse98 (select .cse99 .cse15)) (.cse101 (select .cse100 .cse15))) (let ((.cse88 (select .cse101 .cse13)) (.cse97 (store .cse100 .cse15 (store .cse101 .cse16 v_ArrVal_2978))) (.cse92 (store .cse99 .cse15 (store .cse98 .cse16 v_ArrVal_2979))) (.cse93 (select .cse98 .cse13))) (let ((.cse94 (select .cse92 .cse93)) (.cse96 (select .cse97 .cse93)) (.cse95 (+ 4 .cse88))) (let ((.cse89 (store .cse97 .cse93 (store .cse96 .cse95 v_ArrVal_2984))) (.cse90 (select .cse94 .cse88))) (let ((.cse91 (select .cse89 .cse90)) (.cse87 (select .cse96 .cse88))) (let ((.cse86 (select .cse91 .cse87))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse86) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse87) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse88) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store .cse89 .cse90 (store .cse91 (+ .cse87 4) v_ArrVal_2987)) (select (select (store .cse92 .cse93 (store .cse94 .cse95 v_ArrVal_2985)) .cse90) .cse87)) .cse86))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse116 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse114 (select .cse116 .cse15)) (.cse115 (select .cse117 .cse15))) (let ((.cse112 (store .cse117 .cse15 (store .cse115 .cse16 v_ArrVal_2979))) (.cse108 (store .cse116 .cse15 (store .cse114 .cse16 v_ArrVal_2978))) (.cse109 (select .cse115 .cse13))) (let ((.cse110 (select .cse108 .cse109)) (.cse113 (select .cse112 .cse109)) (.cse104 (select .cse114 .cse13))) (let ((.cse111 (+ 4 .cse104)) (.cse103 (select .cse113 .cse104)) (.cse107 (select .cse110 .cse104))) (let ((.cse102 (select (select (store .cse112 .cse109 (store .cse113 .cse111 v_ArrVal_2985)) .cse103) .cse107))) (or (= .cse102 |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse103 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse104) (= |c_ULTIMATE.start_main_~head~1#1.offset| (let ((.cse105 (store .cse108 .cse109 (store .cse110 .cse111 v_ArrVal_2984)))) (let ((.cse106 (select .cse105 .cse103))) (select (select (store .cse105 .cse103 (store .cse106 (+ .cse107 4) v_ArrVal_2987)) .cse102) (select .cse106 .cse107))))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse133 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse132 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse130 (select .cse132 .cse15)) (.cse131 (select .cse133 .cse15))) (let ((.cse128 (store .cse133 .cse15 (store .cse131 .cse16 v_ArrVal_2979))) (.cse124 (store .cse132 .cse15 (store .cse130 .cse16 v_ArrVal_2978))) (.cse125 (select .cse131 .cse13))) (let ((.cse126 (select .cse124 .cse125)) (.cse129 (select .cse128 .cse125)) (.cse120 (select .cse130 .cse13))) (let ((.cse127 (+ 4 .cse120)) (.cse122 (select .cse129 .cse120)) (.cse119 (select .cse126 .cse120))) (let ((.cse118 (select (select (store .cse128 .cse125 (store .cse129 .cse127 v_ArrVal_2985)) .cse122) .cse119))) (or (= .cse118 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse119) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse120) (= |c_ULTIMATE.start_main_~head~1#1.offset| (let ((.cse121 (store .cse124 .cse125 (store .cse126 .cse127 v_ArrVal_2984)))) (let ((.cse123 (select .cse121 .cse122))) (select (select (store .cse121 .cse122 (store .cse123 (+ .cse119 4) v_ArrVal_2987)) .cse118) (select .cse123 .cse119))))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse148 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse146 (select .cse148 .cse15)) (.cse147 (select .cse149 .cse15))) (let ((.cse143 (store .cse149 .cse15 (store .cse147 .cse16 v_ArrVal_2979))) (.cse140 (store .cse148 .cse15 (store .cse146 .cse16 v_ArrVal_2978))) (.cse135 (select .cse147 .cse13))) (let ((.cse141 (select .cse140 .cse135)) (.cse144 (select .cse143 .cse135)) (.cse145 (select .cse146 .cse13))) (let ((.cse142 (+ 4 .cse145)) (.cse136 (select .cse144 .cse145)) (.cse139 (select .cse141 .cse145))) (let ((.cse134 (select (select (store .cse143 .cse135 (store .cse144 .cse142 v_ArrVal_2985)) .cse136) .cse139))) (or (= .cse134 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse135) (= .cse136 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| (let ((.cse137 (store .cse140 .cse135 (store .cse141 .cse142 v_ArrVal_2984)))) (let ((.cse138 (select .cse137 .cse136))) (select (select (store .cse137 .cse136 (store .cse138 (+ .cse139 4) v_ArrVal_2987)) .cse134) (select .cse138 .cse139))))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse165 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse164 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse162 (select .cse164 .cse15)) (.cse163 (select .cse165 .cse15))) (let ((.cse155 (store .cse165 .cse15 (store .cse163 .cse16 v_ArrVal_2979))) (.cse160 (store .cse164 .cse15 (store .cse162 .cse16 v_ArrVal_2978))) (.cse156 (select .cse163 .cse13))) (let ((.cse161 (select .cse160 .cse156)) (.cse157 (select .cse155 .cse156)) (.cse159 (select .cse162 .cse13))) (let ((.cse158 (+ 4 .cse159)) (.cse152 (select .cse157 .cse159)) (.cse154 (select .cse161 .cse159))) (let ((.cse150 (select (select (store .cse160 .cse156 (store .cse161 .cse158 v_ArrVal_2984)) .cse152) .cse154))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse150) (= (select (let ((.cse151 (store .cse155 .cse156 (store .cse157 .cse158 v_ArrVal_2985)))) (let ((.cse153 (select .cse151 .cse152))) (select (store .cse151 .cse152 (store .cse153 (+ .cse154 4) v_ArrVal_2989)) (select .cse153 .cse154)))) .cse150) |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse152 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse159))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse180 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse178 (select .cse180 .cse15)) (.cse179 (select .cse181 .cse15))) (let ((.cse172 (store .cse181 .cse15 (store .cse179 .cse16 v_ArrVal_2979))) (.cse175 (store .cse180 .cse15 (store .cse178 .cse16 v_ArrVal_2978))) (.cse167 (select .cse179 .cse13))) (let ((.cse176 (select .cse175 .cse167)) (.cse173 (select .cse172 .cse167)) (.cse177 (select .cse178 .cse13))) (let ((.cse174 (+ 4 .cse177)) (.cse170 (select .cse173 .cse177)) (.cse168 (select .cse176 .cse177))) (let ((.cse166 (select (select (store .cse175 .cse167 (store .cse176 .cse174 v_ArrVal_2984)) .cse170) .cse168))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse166) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse167) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse168) (= (select (let ((.cse169 (store .cse172 .cse167 (store .cse173 .cse174 v_ArrVal_2985)))) (let ((.cse171 (select .cse169 .cse170))) (select (store .cse169 .cse170 (store .cse171 (+ .cse168 4) v_ArrVal_2989)) (select .cse171 .cse168)))) .cse166) |c_ULTIMATE.start_main_~head~1#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse197 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse196 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse194 (select .cse196 .cse15)) (.cse195 (select .cse197 .cse15))) (let ((.cse188 (store .cse197 .cse15 (store .cse195 .cse16 v_ArrVal_2979))) (.cse191 (store .cse196 .cse15 (store .cse194 .cse16 v_ArrVal_2978))) (.cse183 (select .cse195 .cse13))) (let ((.cse192 (select .cse191 .cse183)) (.cse189 (select .cse188 .cse183)) (.cse193 (select .cse194 .cse13))) (let ((.cse190 (+ 4 .cse193)) (.cse185 (select .cse189 .cse193)) (.cse187 (select .cse192 .cse193))) (let ((.cse182 (select (select (store .cse191 .cse183 (store .cse192 .cse190 v_ArrVal_2984)) .cse185) .cse187))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse182) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse183) (= (select (let ((.cse184 (store .cse188 .cse183 (store .cse189 .cse190 v_ArrVal_2985)))) (let ((.cse186 (select .cse184 .cse185))) (select (store .cse184 .cse185 (store .cse186 (+ .cse187 4) v_ArrVal_2989)) (select .cse186 .cse187)))) .cse182) |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse185 |c_ULTIMATE.start_main_~head~1#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse213 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977))) (.cse212 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976)))) (let ((.cse210 (select .cse212 .cse15)) (.cse211 (select .cse213 .cse15))) (let ((.cse203 (store .cse213 .cse15 (store .cse211 .cse16 v_ArrVal_2979))) (.cse208 (store .cse212 .cse15 (store .cse210 .cse16 v_ArrVal_2978))) (.cse204 (select .cse211 .cse13))) (let ((.cse209 (select .cse208 .cse204)) (.cse205 (select .cse203 .cse204)) (.cse207 (select .cse210 .cse13))) (let ((.cse206 (+ 4 .cse207)) (.cse201 (select .cse205 .cse207)) (.cse199 (select .cse209 .cse207))) (let ((.cse198 (select (select (store .cse208 .cse204 (store .cse209 .cse206 v_ArrVal_2984)) .cse201) .cse199))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse198) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse199) (= (select (let ((.cse200 (store .cse203 .cse204 (store .cse205 .cse206 v_ArrVal_2985)))) (let ((.cse202 (select .cse200 .cse201))) (select (store .cse200 .cse201 (store .cse202 (+ .cse199 4) v_ArrVal_2989)) (select .cse202 .cse199)))) .cse198) |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse207))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse226 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse229 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse228 (select .cse229 .cse15)) (.cse227 (select .cse226 .cse15))) (let ((.cse223 (select .cse227 .cse13)) (.cse225 (store .cse229 .cse15 (store .cse228 .cse16 v_ArrVal_2979))) (.cse220 (select .cse228 .cse13))) (let ((.cse224 (select .cse225 .cse220)) (.cse222 (+ 4 .cse223)) (.cse219 (store .cse226 .cse15 (store .cse227 .cse16 v_ArrVal_2978)))) (let ((.cse221 (select .cse219 .cse220)) (.cse215 (store .cse225 .cse220 (store .cse224 .cse222 v_ArrVal_2985))) (.cse216 (select .cse224 .cse223))) (let ((.cse217 (select .cse215 .cse216)) (.cse218 (select .cse221 .cse223))) (let ((.cse214 (select .cse217 .cse218))) (or (= .cse214 |c_ULTIMATE.start_main_~head~1#1.base|) (= (select (select (store .cse215 .cse216 (store .cse217 (+ .cse218 4) v_ArrVal_2989)) .cse214) (select (select (store .cse219 .cse220 (store .cse221 .cse222 v_ArrVal_2984)) .cse216) .cse218)) |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse216 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse223)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse242 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse245 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse244 (select .cse245 .cse15)) (.cse243 (select .cse242 .cse15))) (let ((.cse239 (select .cse243 .cse13)) (.cse241 (store .cse245 .cse15 (store .cse244 .cse16 v_ArrVal_2979))) (.cse231 (select .cse244 .cse13))) (let ((.cse240 (select .cse241 .cse231)) (.cse238 (+ 4 .cse239)) (.cse236 (store .cse242 .cse15 (store .cse243 .cse16 v_ArrVal_2978)))) (let ((.cse237 (select .cse236 .cse231)) (.cse232 (store .cse241 .cse231 (store .cse240 .cse238 v_ArrVal_2985))) (.cse233 (select .cse240 .cse239))) (let ((.cse234 (select .cse232 .cse233)) (.cse235 (select .cse237 .cse239))) (let ((.cse230 (select .cse234 .cse235))) (or (= .cse230 |c_ULTIMATE.start_main_~head~1#1.base|) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse231) (= (select (select (store .cse232 .cse233 (store .cse234 (+ .cse235 4) v_ArrVal_2989)) .cse230) (select (select (store .cse236 .cse231 (store .cse237 .cse238 v_ArrVal_2984)) .cse233) .cse235)) |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse233 |c_ULTIMATE.start_main_~head~1#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse260 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse21 .cse20 v_ArrVal_2976))) (.cse259 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base| (store .cse19 .cse20 v_ArrVal_2977)))) (let ((.cse258 (select .cse259 .cse15)) (.cse261 (select .cse260 .cse15))) (let ((.cse256 (select .cse261 .cse13)) (.cse257 (store .cse260 .cse15 (store .cse261 .cse16 v_ArrVal_2978))) (.cse252 (store .cse259 .cse15 (store .cse258 .cse16 v_ArrVal_2979))) (.cse247 (select .cse258 .cse13))) (let ((.cse253 (select .cse252 .cse247)) (.cse255 (select .cse257 .cse247)) (.cse254 (+ 4 .cse256))) (let ((.cse249 (store .cse257 .cse247 (store .cse255 .cse254 v_ArrVal_2984))) (.cse250 (select .cse253 .cse256))) (let ((.cse251 (select .cse249 .cse250)) (.cse248 (select .cse255 .cse256))) (let ((.cse246 (select .cse251 .cse248))) (or (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse246) (= |c_ULTIMATE.start_main_~head~1#1.base| .cse247) (= |c_ULTIMATE.start_main_~head~1#1.offset| .cse248) (= |c_ULTIMATE.start_main_~head~1#1.offset| (select (select (store .cse249 .cse250 (store .cse251 (+ .cse248 4) v_ArrVal_2987)) (select (select (store .cse252 .cse247 (store .cse253 .cse254 v_ArrVal_2985)) .cse250) .cse248)) .cse246))))))))))))) (and (= .cse15 |c_ULTIMATE.start_main_~head~1#1.base|) (= .cse13 |c_ULTIMATE.start_main_~head~1#1.offset|))))) is different from true [2022-10-16 14:19:15,371 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse21 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse21 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse19 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse1)) (let ((.cse17 (+ .cse1 4)) (.cse20 (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4))) (and (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse14 (select .cse16 .cse0)) (.cse15 (select .cse18 .cse0))) (let ((.cse12 (store .cse18 .cse0 (store .cse15 .cse17 v_ArrVal_2979))) (.cse7 (store .cse16 .cse0 (store .cse14 .cse17 v_ArrVal_2978))) (.cse8 (select .cse15 .cse1))) (let ((.cse9 (select .cse7 .cse8)) (.cse13 (select .cse12 .cse8)) (.cse11 (select .cse14 .cse1))) (let ((.cse10 (+ .cse11 4)) (.cse5 (select .cse13 .cse11)) (.cse3 (select .cse9 .cse11))) (let ((.cse2 (select (select (store .cse12 .cse8 (store .cse13 .cse10 v_ArrVal_2985)) .cse5) .cse3))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse3) (= (let ((.cse4 (store .cse7 .cse8 (store .cse9 .cse10 v_ArrVal_2984)))) (let ((.cse6 (select .cse4 .cse5))) (select (select (store .cse4 .cse5 (store .cse6 (+ .cse3 4) v_ArrVal_2987)) .cse2) (select .cse6 .cse3)))) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse11))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse36 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse34 (select .cse36 .cse0)) (.cse35 (select .cse37 .cse0))) (let ((.cse27 (store .cse37 .cse0 (store .cse35 .cse17 v_ArrVal_2979))) (.cse32 (store .cse36 .cse0 (store .cse34 .cse17 v_ArrVal_2978))) (.cse28 (select .cse35 .cse1))) (let ((.cse33 (select .cse32 .cse28)) (.cse29 (select .cse27 .cse28)) (.cse31 (select .cse34 .cse1))) (let ((.cse30 (+ .cse31 4)) (.cse25 (select .cse29 .cse31)) (.cse22 (select .cse33 .cse31))) (let ((.cse23 (select (select (store .cse32 .cse28 (store .cse33 .cse30 v_ArrVal_2984)) .cse25) .cse22))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse22) (= .cse23 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse24 (store .cse27 .cse28 (store .cse29 .cse30 v_ArrVal_2985)))) (let ((.cse26 (select .cse24 .cse25))) (select (store .cse24 .cse25 (store .cse26 (+ .cse22 4) v_ArrVal_2989)) (select .cse26 .cse22)))) .cse23)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse31))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse53 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse52 (select .cse53 .cse0)) (.cse51 (select .cse50 .cse0))) (let ((.cse47 (select .cse51 .cse1)) (.cse49 (store .cse53 .cse0 (store .cse52 .cse17 v_ArrVal_2979))) (.cse44 (select .cse52 .cse1))) (let ((.cse48 (select .cse49 .cse44)) (.cse46 (+ .cse47 4)) (.cse43 (store .cse50 .cse0 (store .cse51 .cse17 v_ArrVal_2978)))) (let ((.cse45 (select .cse43 .cse44)) (.cse40 (store .cse49 .cse44 (store .cse48 .cse46 v_ArrVal_2985))) (.cse41 (select .cse48 .cse47))) (let ((.cse42 (select .cse40 .cse41)) (.cse39 (select .cse45 .cse47))) (let ((.cse38 (select .cse42 .cse39))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse38) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse39) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse40 .cse41 (store .cse42 (+ .cse39 4) v_ArrVal_2989)) .cse38) (select (select (store .cse43 .cse44 (store .cse45 .cse46 v_ArrVal_2984)) .cse41) .cse39))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse47)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse69 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse68 (select .cse69 .cse0)) (.cse67 (select .cse66 .cse0))) (let ((.cse63 (select .cse67 .cse1)) (.cse65 (store .cse69 .cse0 (store .cse68 .cse17 v_ArrVal_2979))) (.cse56 (select .cse68 .cse1))) (let ((.cse64 (select .cse65 .cse56)) (.cse62 (+ .cse63 4)) (.cse60 (store .cse66 .cse0 (store .cse67 .cse17 v_ArrVal_2978)))) (let ((.cse61 (select .cse60 .cse56)) (.cse57 (store .cse65 .cse56 (store .cse64 .cse62 v_ArrVal_2985))) (.cse58 (select .cse64 .cse63))) (let ((.cse59 (select .cse57 .cse58)) (.cse55 (select .cse61 .cse63))) (let ((.cse54 (select .cse59 .cse55))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse54) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse55) (= .cse56 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse57 .cse58 (store .cse59 (+ .cse55 4) v_ArrVal_2989)) .cse54) (select (select (store .cse60 .cse56 (store .cse61 .cse62 v_ArrVal_2984)) .cse58) .cse55)))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse84 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse83 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse82 (select .cse83 .cse0)) (.cse85 (select .cse84 .cse0))) (let ((.cse80 (select .cse85 .cse1)) (.cse81 (store .cse84 .cse0 (store .cse85 .cse17 v_ArrVal_2978))) (.cse75 (store .cse83 .cse0 (store .cse82 .cse17 v_ArrVal_2979))) (.cse71 (select .cse82 .cse1))) (let ((.cse76 (select .cse75 .cse71)) (.cse79 (select .cse81 .cse71)) (.cse77 (+ .cse80 4))) (let ((.cse72 (store .cse81 .cse71 (store .cse79 .cse77 v_ArrVal_2984))) (.cse70 (select .cse76 .cse80))) (let ((.cse73 (select .cse72 .cse70)) (.cse74 (select .cse79 .cse80))) (let ((.cse78 (select .cse73 .cse74))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse70) (= .cse71 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store .cse72 .cse70 (store .cse73 (+ .cse74 4) v_ArrVal_2987)) (select (select (store .cse75 .cse71 (store .cse76 .cse77 v_ArrVal_2985)) .cse70) .cse74)) .cse78) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse78 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse101 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse100 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse98 (select .cse100 .cse0)) (.cse99 (select .cse101 .cse0))) (let ((.cse95 (store .cse101 .cse0 (store .cse99 .cse17 v_ArrVal_2979))) (.cse92 (store .cse100 .cse0 (store .cse98 .cse17 v_ArrVal_2978))) (.cse88 (select .cse99 .cse1))) (let ((.cse93 (select .cse92 .cse88)) (.cse96 (select .cse95 .cse88)) (.cse97 (select .cse98 .cse1))) (let ((.cse94 (+ .cse97 4)) (.cse90 (select .cse96 .cse97)) (.cse87 (select .cse93 .cse97))) (let ((.cse86 (select (select (store .cse95 .cse88 (store .cse96 .cse94 v_ArrVal_2985)) .cse90) .cse87))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse86) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse87) (= .cse88 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (let ((.cse89 (store .cse92 .cse88 (store .cse93 .cse94 v_ArrVal_2984)))) (let ((.cse91 (select .cse89 .cse90))) (select (select (store .cse89 .cse90 (store .cse91 (+ .cse87 4) v_ArrVal_2987)) .cse86) (select .cse91 .cse87)))) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse114 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse116 (select .cse117 .cse0)) (.cse115 (select .cse114 .cse0))) (let ((.cse111 (select .cse115 .cse1)) (.cse113 (store .cse117 .cse0 (store .cse116 .cse17 v_ArrVal_2979))) (.cse108 (select .cse116 .cse1))) (let ((.cse112 (select .cse113 .cse108)) (.cse110 (+ .cse111 4)) (.cse107 (store .cse114 .cse0 (store .cse115 .cse17 v_ArrVal_2978)))) (let ((.cse109 (select .cse107 .cse108)) (.cse104 (store .cse113 .cse108 (store .cse112 .cse110 v_ArrVal_2985))) (.cse103 (select .cse112 .cse111))) (let ((.cse105 (select .cse104 .cse103)) (.cse106 (select .cse109 .cse111))) (let ((.cse102 (select .cse105 .cse106))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse102) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse103) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse104 .cse103 (store .cse105 (+ .cse106 4) v_ArrVal_2989)) .cse102) (select (select (store .cse107 .cse108 (store .cse109 .cse110 v_ArrVal_2984)) .cse103) .cse106))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse111)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse130 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse133 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse132 (select .cse133 .cse0)) (.cse131 (select .cse130 .cse0))) (let ((.cse127 (select .cse131 .cse1)) (.cse129 (store .cse133 .cse0 (store .cse132 .cse17 v_ArrVal_2979))) (.cse120 (select .cse132 .cse1))) (let ((.cse128 (select .cse129 .cse120)) (.cse126 (+ .cse127 4)) (.cse124 (store .cse130 .cse0 (store .cse131 .cse17 v_ArrVal_2978)))) (let ((.cse125 (select .cse124 .cse120)) (.cse121 (store .cse129 .cse120 (store .cse128 .cse126 v_ArrVal_2985))) (.cse119 (select .cse128 .cse127))) (let ((.cse122 (select .cse121 .cse119)) (.cse123 (select .cse125 .cse127))) (let ((.cse118 (select .cse122 .cse123))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse118) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse119) (= .cse120 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse121 .cse119 (store .cse122 (+ .cse123 4) v_ArrVal_2989)) .cse118) (select (select (store .cse124 .cse120 (store .cse125 .cse126 v_ArrVal_2984)) .cse119) .cse123)))))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse148 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse146 (select .cse148 .cse0)) (.cse147 (select .cse149 .cse0))) (let ((.cse140 (store .cse149 .cse0 (store .cse147 .cse17 v_ArrVal_2979))) (.cse143 (store .cse148 .cse0 (store .cse146 .cse17 v_ArrVal_2978))) (.cse135 (select .cse147 .cse1))) (let ((.cse144 (select .cse143 .cse135)) (.cse141 (select .cse140 .cse135)) (.cse145 (select .cse146 .cse1))) (let ((.cse142 (+ .cse145 4)) (.cse134 (select .cse141 .cse145)) (.cse139 (select .cse144 .cse145))) (let ((.cse136 (select (select (store .cse143 .cse135 (store .cse144 .cse142 v_ArrVal_2984)) .cse134) .cse139))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse134) (= .cse135 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= .cse136 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse137 (store .cse140 .cse135 (store .cse141 .cse142 v_ArrVal_2985)))) (let ((.cse138 (select .cse137 .cse134))) (select (store .cse137 .cse134 (store .cse138 (+ .cse139 4) v_ArrVal_2989)) (select .cse138 .cse139)))) .cse136)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse165 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse164 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse162 (select .cse164 .cse0)) (.cse163 (select .cse165 .cse0))) (let ((.cse155 (store .cse165 .cse0 (store .cse163 .cse17 v_ArrVal_2979))) (.cse160 (store .cse164 .cse0 (store .cse162 .cse17 v_ArrVal_2978))) (.cse156 (select .cse163 .cse1))) (let ((.cse161 (select .cse160 .cse156)) (.cse157 (select .cse155 .cse156)) (.cse159 (select .cse162 .cse1))) (let ((.cse158 (+ .cse159 4)) (.cse150 (select .cse157 .cse159)) (.cse154 (select .cse161 .cse159))) (let ((.cse151 (select (select (store .cse160 .cse156 (store .cse161 .cse158 v_ArrVal_2984)) .cse150) .cse154))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse150) (= .cse151 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse152 (store .cse155 .cse156 (store .cse157 .cse158 v_ArrVal_2985)))) (let ((.cse153 (select .cse152 .cse150))) (select (store .cse152 .cse150 (store .cse153 (+ .cse154 4) v_ArrVal_2989)) (select .cse153 .cse154)))) .cse151)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse159))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse181 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse180 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse178 (select .cse180 .cse0)) (.cse179 (select .cse181 .cse0))) (let ((.cse172 (store .cse181 .cse0 (store .cse179 .cse17 v_ArrVal_2979))) (.cse175 (store .cse180 .cse0 (store .cse178 .cse17 v_ArrVal_2978))) (.cse167 (select .cse179 .cse1))) (let ((.cse176 (select .cse175 .cse167)) (.cse173 (select .cse172 .cse167)) (.cse177 (select .cse178 .cse1))) (let ((.cse174 (+ .cse177 4)) (.cse170 (select .cse173 .cse177)) (.cse166 (select .cse176 .cse177))) (let ((.cse168 (select (select (store .cse175 .cse167 (store .cse176 .cse174 v_ArrVal_2984)) .cse170) .cse166))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse166) (= .cse167 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= .cse168 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse169 (store .cse172 .cse167 (store .cse173 .cse174 v_ArrVal_2985)))) (let ((.cse171 (select .cse169 .cse170))) (select (store .cse169 .cse170 (store .cse171 (+ .cse166 4) v_ArrVal_2989)) (select .cse171 .cse166)))) .cse168)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse197 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse196 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse194 (select .cse196 .cse0)) (.cse195 (select .cse197 .cse0))) (let ((.cse192 (store .cse197 .cse0 (store .cse195 .cse17 v_ArrVal_2979))) (.cse187 (store .cse196 .cse0 (store .cse194 .cse17 v_ArrVal_2978))) (.cse188 (select .cse195 .cse1))) (let ((.cse189 (select .cse187 .cse188)) (.cse193 (select .cse192 .cse188)) (.cse191 (select .cse194 .cse1))) (let ((.cse190 (+ .cse191 4)) (.cse183 (select .cse193 .cse191)) (.cse186 (select .cse189 .cse191))) (let ((.cse182 (select (select (store .cse192 .cse188 (store .cse193 .cse190 v_ArrVal_2985)) .cse183) .cse186))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse182) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse183) (= (let ((.cse184 (store .cse187 .cse188 (store .cse189 .cse190 v_ArrVal_2984)))) (let ((.cse185 (select .cse184 .cse183))) (select (select (store .cse184 .cse183 (store .cse185 (+ .cse186 4) v_ArrVal_2987)) .cse182) (select .cse185 .cse186)))) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse191))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse212 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse211 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse210 (select .cse211 .cse0)) (.cse213 (select .cse212 .cse0))) (let ((.cse208 (select .cse213 .cse1)) (.cse209 (store .cse212 .cse0 (store .cse213 .cse17 v_ArrVal_2978))) (.cse203 (store .cse211 .cse0 (store .cse210 .cse17 v_ArrVal_2979))) (.cse199 (select .cse210 .cse1))) (let ((.cse204 (select .cse203 .cse199)) (.cse207 (select .cse209 .cse199)) (.cse205 (+ .cse208 4))) (let ((.cse200 (store .cse209 .cse199 (store .cse207 .cse205 v_ArrVal_2984))) (.cse201 (select .cse204 .cse208))) (let ((.cse202 (select .cse200 .cse201)) (.cse198 (select .cse207 .cse208))) (let ((.cse206 (select .cse202 .cse198))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse198) (= .cse199 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store .cse200 .cse201 (store .cse202 (+ .cse198 4) v_ArrVal_2987)) (select (select (store .cse203 .cse199 (store .cse204 .cse205 v_ArrVal_2985)) .cse201) .cse198)) .cse206) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse206 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse229 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977))) (.cse228 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976)))) (let ((.cse226 (select .cse228 .cse0)) (.cse227 (select .cse229 .cse0))) (let ((.cse223 (store .cse229 .cse0 (store .cse227 .cse17 v_ArrVal_2979))) (.cse220 (store .cse228 .cse0 (store .cse226 .cse17 v_ArrVal_2978))) (.cse216 (select .cse227 .cse1))) (let ((.cse221 (select .cse220 .cse216)) (.cse224 (select .cse223 .cse216)) (.cse225 (select .cse226 .cse1))) (let ((.cse222 (+ .cse225 4)) (.cse215 (select .cse224 .cse225)) (.cse219 (select .cse221 .cse225))) (let ((.cse214 (select (select (store .cse223 .cse216 (store .cse224 .cse222 v_ArrVal_2985)) .cse215) .cse219))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse214) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse215) (= .cse216 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (= (let ((.cse217 (store .cse220 .cse216 (store .cse221 .cse222 v_ArrVal_2984)))) (let ((.cse218 (select .cse217 .cse215))) (select (select (store .cse217 .cse215 (store .cse218 (+ .cse219 4) v_ArrVal_2987)) .cse214) (select .cse218 .cse219)))) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse244 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse243 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse242 (select .cse243 .cse0)) (.cse245 (select .cse244 .cse0))) (let ((.cse239 (select .cse245 .cse1)) (.cse241 (store .cse244 .cse0 (store .cse245 .cse17 v_ArrVal_2978))) (.cse234 (store .cse243 .cse0 (store .cse242 .cse17 v_ArrVal_2979))) (.cse235 (select .cse242 .cse1))) (let ((.cse236 (select .cse234 .cse235)) (.cse240 (select .cse241 .cse235)) (.cse237 (+ .cse239 4))) (let ((.cse231 (store .cse241 .cse235 (store .cse240 .cse237 v_ArrVal_2984))) (.cse230 (select .cse236 .cse239))) (let ((.cse232 (select .cse231 .cse230)) (.cse233 (select .cse240 .cse239))) (let ((.cse238 (select .cse232 .cse233))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse230) (= (select (select (store .cse231 .cse230 (store .cse232 (+ .cse233 4) v_ArrVal_2987)) (select (select (store .cse234 .cse235 (store .cse236 .cse237 v_ArrVal_2985)) .cse230) .cse233)) .cse238) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse238 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse239)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse260 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse19 .cse20 v_ArrVal_2976))) (.cse259 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse21 .cse20 v_ArrVal_2977)))) (let ((.cse258 (select .cse259 .cse0)) (.cse261 (select .cse260 .cse0))) (let ((.cse255 (select .cse261 .cse1)) (.cse257 (store .cse260 .cse0 (store .cse261 .cse17 v_ArrVal_2978))) (.cse250 (store .cse259 .cse0 (store .cse258 .cse17 v_ArrVal_2979))) (.cse251 (select .cse258 .cse1))) (let ((.cse252 (select .cse250 .cse251)) (.cse256 (select .cse257 .cse251)) (.cse253 (+ .cse255 4))) (let ((.cse247 (store .cse257 .cse251 (store .cse256 .cse253 v_ArrVal_2984))) (.cse248 (select .cse252 .cse255))) (let ((.cse249 (select .cse247 .cse248)) (.cse246 (select .cse256 .cse255))) (let ((.cse254 (select .cse249 .cse246))) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse246) (= (select (select (store .cse247 .cse248 (store .cse249 (+ .cse246 4) v_ArrVal_2987)) (select (select (store .cse250 .cse251 (store .cse252 .cse253 v_ArrVal_2985)) .cse248) .cse246)) .cse254) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse254 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| .cse255))))))))))))))) is different from true [2022-10-16 14:19:19,334 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_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.base|))) (.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_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|)))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse23 (select .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse23 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (let ((.cse17 (+ .cse1 4)) (.cse21 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse18 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse16 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse14 (select .cse16 .cse0)) (.cse15 (select .cse18 .cse0))) (let ((.cse12 (store .cse18 .cse0 (store .cse15 .cse17 v_ArrVal_2979))) (.cse8 (store .cse16 .cse0 (store .cse14 .cse17 v_ArrVal_2978))) (.cse9 (select .cse15 .cse1))) (let ((.cse10 (select .cse8 .cse9)) (.cse13 (select .cse12 .cse9)) (.cse2 (select .cse14 .cse1))) (let ((.cse11 (+ .cse2 4)) (.cse4 (select .cse13 .cse2)) (.cse6 (select .cse10 .cse2))) (let ((.cse7 (select (select (store .cse12 .cse9 (store .cse13 .cse11 v_ArrVal_2985)) .cse4) .cse6))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (let ((.cse3 (store .cse8 .cse9 (store .cse10 .cse11 v_ArrVal_2984)))) (let ((.cse5 (select .cse3 .cse4))) (select (select (store .cse3 .cse4 (store .cse5 (+ 4 .cse6) v_ArrVal_2987)) .cse7) (select .cse5 .cse6)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse6) (= .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse36 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse39 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse38 (select .cse39 .cse0)) (.cse37 (select .cse36 .cse0))) (let ((.cse33 (select .cse37 .cse1)) (.cse35 (store .cse39 .cse0 (store .cse38 .cse17 v_ArrVal_2979))) (.cse30 (select .cse38 .cse1))) (let ((.cse34 (select .cse35 .cse30)) (.cse32 (+ .cse33 4)) (.cse29 (store .cse36 .cse0 (store .cse37 .cse17 v_ArrVal_2978)))) (let ((.cse31 (select .cse29 .cse30)) (.cse25 (store .cse35 .cse30 (store .cse34 .cse32 v_ArrVal_2985))) (.cse24 (select .cse34 .cse33))) (let ((.cse26 (select .cse25 .cse24)) (.cse27 (select .cse31 .cse33))) (let ((.cse28 (select .cse26 .cse27))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse24) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse25 .cse24 (store .cse26 (+ 4 .cse27) v_ArrVal_2989)) .cse28) (select (select (store .cse29 .cse30 (store .cse31 .cse32 v_ArrVal_2984)) .cse24) .cse27))) (= .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse30 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse54 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse53 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse52 (select .cse53 .cse0)) (.cse55 (select .cse54 .cse0))) (let ((.cse50 (select .cse55 .cse1)) (.cse51 (store .cse54 .cse0 (store .cse55 .cse17 v_ArrVal_2978))) (.cse44 (store .cse53 .cse0 (store .cse52 .cse17 v_ArrVal_2979))) (.cse45 (select .cse52 .cse1))) (let ((.cse46 (select .cse44 .cse45)) (.cse49 (select .cse51 .cse45)) (.cse47 (+ .cse50 4))) (let ((.cse40 (store .cse51 .cse45 (store .cse49 .cse47 v_ArrVal_2984))) (.cse41 (select .cse46 .cse50))) (let ((.cse42 (select .cse40 .cse41)) (.cse43 (select .cse49 .cse50))) (let ((.cse48 (select .cse42 .cse43))) (or (= (select (select (store .cse40 .cse41 (store .cse42 (+ 4 .cse43) v_ArrVal_2987)) (select (select (store .cse44 .cse45 (store .cse46 .cse47 v_ArrVal_2985)) .cse41) .cse43)) .cse48) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse43) (= .cse48 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= .cse45 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse71 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse70 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse68 (select .cse70 .cse0)) (.cse69 (select .cse71 .cse0))) (let ((.cse62 (store .cse71 .cse0 (store .cse69 .cse17 v_ArrVal_2979))) (.cse66 (store .cse70 .cse0 (store .cse68 .cse17 v_ArrVal_2978))) (.cse63 (select .cse69 .cse1))) (let ((.cse67 (select .cse66 .cse63)) (.cse64 (select .cse62 .cse63)) (.cse56 (select .cse68 .cse1))) (let ((.cse65 (+ .cse56 4)) (.cse60 (select .cse64 .cse56)) (.cse57 (select .cse67 .cse56))) (let ((.cse58 (select (select (store .cse66 .cse63 (store .cse67 .cse65 v_ArrVal_2984)) .cse60) .cse57))) (or (= .cse56 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse57) (= .cse58 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse59 (store .cse62 .cse63 (store .cse64 .cse65 v_ArrVal_2985)))) (let ((.cse61 (select .cse59 .cse60))) (select (store .cse59 .cse60 (store .cse61 (+ 4 .cse57) v_ArrVal_2989)) (select .cse61 .cse57)))) .cse58)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse87 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse86 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse84 (select .cse86 .cse0)) (.cse85 (select .cse87 .cse0))) (let ((.cse81 (store .cse87 .cse0 (store .cse85 .cse17 v_ArrVal_2979))) (.cse77 (store .cse86 .cse0 (store .cse84 .cse17 v_ArrVal_2978))) (.cse78 (select .cse85 .cse1))) (let ((.cse79 (select .cse77 .cse78)) (.cse82 (select .cse81 .cse78)) (.cse83 (select .cse84 .cse1))) (let ((.cse80 (+ .cse83 4)) (.cse73 (select .cse82 .cse83)) (.cse75 (select .cse79 .cse83))) (let ((.cse76 (select (select (store .cse81 .cse78 (store .cse82 .cse80 v_ArrVal_2985)) .cse73) .cse75))) (or (= (let ((.cse72 (store .cse77 .cse78 (store .cse79 .cse80 v_ArrVal_2984)))) (let ((.cse74 (select .cse72 .cse73))) (select (select (store .cse72 .cse73 (store .cse74 (+ 4 .cse75) v_ArrVal_2987)) .cse76) (select .cse74 .cse75)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse75) (= .cse76 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse78 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse100 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse103 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse102 (select .cse103 .cse0)) (.cse101 (select .cse100 .cse0))) (let ((.cse97 (select .cse101 .cse1)) (.cse99 (store .cse103 .cse0 (store .cse102 .cse17 v_ArrVal_2979))) (.cse94 (select .cse102 .cse1))) (let ((.cse98 (select .cse99 .cse94)) (.cse96 (+ .cse97 4)) (.cse93 (store .cse100 .cse0 (store .cse101 .cse17 v_ArrVal_2978)))) (let ((.cse95 (select .cse93 .cse94)) (.cse89 (store .cse99 .cse94 (store .cse98 .cse96 v_ArrVal_2985))) (.cse90 (select .cse98 .cse97))) (let ((.cse91 (select .cse89 .cse90)) (.cse88 (select .cse95 .cse97))) (let ((.cse92 (select .cse91 .cse88))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse88) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse89 .cse90 (store .cse91 (+ 4 .cse88) v_ArrVal_2989)) .cse92) (select (select (store .cse93 .cse94 (store .cse95 .cse96 v_ArrVal_2984)) .cse90) .cse88))) (= .cse92 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse94 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse119 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse118 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse116 (select .cse118 .cse0)) (.cse117 (select .cse119 .cse0))) (let ((.cse113 (store .cse119 .cse0 (store .cse117 .cse17 v_ArrVal_2979))) (.cse109 (store .cse118 .cse0 (store .cse116 .cse17 v_ArrVal_2978))) (.cse110 (select .cse117 .cse1))) (let ((.cse111 (select .cse109 .cse110)) (.cse114 (select .cse113 .cse110)) (.cse115 (select .cse116 .cse1))) (let ((.cse112 (+ .cse115 4)) (.cse105 (select .cse114 .cse115)) (.cse107 (select .cse111 .cse115))) (let ((.cse108 (select (select (store .cse113 .cse110 (store .cse114 .cse112 v_ArrVal_2985)) .cse105) .cse107))) (or (= (let ((.cse104 (store .cse109 .cse110 (store .cse111 .cse112 v_ArrVal_2984)))) (let ((.cse106 (select .cse104 .cse105))) (select (select (store .cse104 .cse105 (store .cse106 (+ 4 .cse107) v_ArrVal_2987)) .cse108) (select .cse106 .cse107)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse105) (= .cse108 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= .cse110 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse135 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse134 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse132 (select .cse134 .cse0)) (.cse133 (select .cse135 .cse0))) (let ((.cse130 (store .cse135 .cse0 (store .cse133 .cse17 v_ArrVal_2979))) (.cse126 (store .cse134 .cse0 (store .cse132 .cse17 v_ArrVal_2978))) (.cse127 (select .cse133 .cse1))) (let ((.cse128 (select .cse126 .cse127)) (.cse131 (select .cse130 .cse127)) (.cse120 (select .cse132 .cse1))) (let ((.cse129 (+ .cse120 4)) (.cse122 (select .cse131 .cse120)) (.cse124 (select .cse128 .cse120))) (let ((.cse125 (select (select (store .cse130 .cse127 (store .cse131 .cse129 v_ArrVal_2985)) .cse122) .cse124))) (or (= .cse120 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (let ((.cse121 (store .cse126 .cse127 (store .cse128 .cse129 v_ArrVal_2984)))) (let ((.cse123 (select .cse121 .cse122))) (select (select (store .cse121 .cse122 (store .cse123 (+ 4 .cse124) v_ArrVal_2987)) .cse125) (select .cse123 .cse124)))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse122) (= .cse125 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse150 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse149 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse148 (select .cse149 .cse0)) (.cse151 (select .cse150 .cse0))) (let ((.cse136 (select .cse151 .cse1)) (.cse147 (store .cse150 .cse0 (store .cse151 .cse17 v_ArrVal_2978))) (.cse141 (store .cse149 .cse0 (store .cse148 .cse17 v_ArrVal_2979))) (.cse142 (select .cse148 .cse1))) (let ((.cse143 (select .cse141 .cse142)) (.cse146 (select .cse147 .cse142)) (.cse144 (+ .cse136 4))) (let ((.cse137 (store .cse147 .cse142 (store .cse146 .cse144 v_ArrVal_2984))) (.cse138 (select .cse143 .cse136))) (let ((.cse139 (select .cse137 .cse138)) (.cse140 (select .cse146 .cse136))) (let ((.cse145 (select .cse139 .cse140))) (or (= .cse136 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store .cse137 .cse138 (store .cse139 (+ 4 .cse140) v_ArrVal_2987)) (select (select (store .cse141 .cse142 (store .cse143 .cse144 v_ArrVal_2985)) .cse138) .cse140)) .cse145) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse140) (= .cse145 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse166 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse165 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse164 (select .cse165 .cse0)) (.cse167 (select .cse166 .cse0))) (let ((.cse152 (select .cse167 .cse1)) (.cse163 (store .cse166 .cse0 (store .cse167 .cse17 v_ArrVal_2978))) (.cse157 (store .cse165 .cse0 (store .cse164 .cse17 v_ArrVal_2979))) (.cse158 (select .cse164 .cse1))) (let ((.cse159 (select .cse157 .cse158)) (.cse162 (select .cse163 .cse158)) (.cse160 (+ .cse152 4))) (let ((.cse153 (store .cse163 .cse158 (store .cse162 .cse160 v_ArrVal_2984))) (.cse154 (select .cse159 .cse152))) (let ((.cse155 (select .cse153 .cse154)) (.cse156 (select .cse162 .cse152))) (let ((.cse161 (select .cse155 .cse156))) (or (= .cse152 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store .cse153 .cse154 (store .cse155 (+ 4 .cse156) v_ArrVal_2987)) (select (select (store .cse157 .cse158 (store .cse159 .cse160 v_ArrVal_2985)) .cse154) .cse156)) .cse161) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse154) (= .cse161 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse183 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse182 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse180 (select .cse182 .cse0)) (.cse181 (select .cse183 .cse0))) (let ((.cse173 (store .cse183 .cse0 (store .cse181 .cse17 v_ArrVal_2979))) (.cse177 (store .cse182 .cse0 (store .cse180 .cse17 v_ArrVal_2978))) (.cse174 (select .cse181 .cse1))) (let ((.cse178 (select .cse177 .cse174)) (.cse175 (select .cse173 .cse174)) (.cse179 (select .cse180 .cse1))) (let ((.cse176 (+ .cse179 4)) (.cse171 (select .cse175 .cse179)) (.cse168 (select .cse178 .cse179))) (let ((.cse169 (select (select (store .cse177 .cse174 (store .cse178 .cse176 v_ArrVal_2984)) .cse171) .cse168))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse168) (= .cse169 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse170 (store .cse173 .cse174 (store .cse175 .cse176 v_ArrVal_2985)))) (let ((.cse172 (select .cse170 .cse171))) (select (store .cse170 .cse171 (store .cse172 (+ 4 .cse168) v_ArrVal_2989)) (select .cse172 .cse168)))) .cse169)) (= .cse174 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2987 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int)) (let ((.cse198 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse197 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse196 (select .cse197 .cse0)) (.cse199 (select .cse198 .cse0))) (let ((.cse194 (select .cse199 .cse1)) (.cse195 (store .cse198 .cse0 (store .cse199 .cse17 v_ArrVal_2978))) (.cse188 (store .cse197 .cse0 (store .cse196 .cse17 v_ArrVal_2979))) (.cse189 (select .cse196 .cse1))) (let ((.cse190 (select .cse188 .cse189)) (.cse193 (select .cse195 .cse189)) (.cse191 (+ .cse194 4))) (let ((.cse184 (store .cse195 .cse189 (store .cse193 .cse191 v_ArrVal_2984))) (.cse185 (select .cse190 .cse194))) (let ((.cse186 (select .cse184 .cse185)) (.cse187 (select .cse193 .cse194))) (let ((.cse192 (select .cse186 .cse187))) (or (= (select (select (store .cse184 .cse185 (store .cse186 (+ 4 .cse187) v_ArrVal_2987)) (select (select (store .cse188 .cse189 (store .cse190 .cse191 v_ArrVal_2985)) .cse185) .cse187)) .cse192) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse185) (= .cse192 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= .cse189 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse212 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse215 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse214 (select .cse215 .cse0)) (.cse213 (select .cse212 .cse0))) (let ((.cse200 (select .cse213 .cse1)) (.cse211 (store .cse215 .cse0 (store .cse214 .cse17 v_ArrVal_2979))) (.cse207 (select .cse214 .cse1))) (let ((.cse210 (select .cse211 .cse207)) (.cse209 (+ .cse200 4)) (.cse206 (store .cse212 .cse0 (store .cse213 .cse17 v_ArrVal_2978)))) (let ((.cse208 (select .cse206 .cse207)) (.cse202 (store .cse211 .cse207 (store .cse210 .cse209 v_ArrVal_2985))) (.cse203 (select .cse210 .cse200))) (let ((.cse204 (select .cse202 .cse203)) (.cse201 (select .cse208 .cse200))) (let ((.cse205 (select .cse204 .cse201))) (or (= .cse200 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse201) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse202 .cse203 (store .cse204 (+ 4 .cse201) v_ArrVal_2989)) .cse205) (select (select (store .cse206 .cse207 (store .cse208 .cse209 v_ArrVal_2984)) .cse203) .cse201))) (= .cse205 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse231 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse230 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse228 (select .cse230 .cse0)) (.cse229 (select .cse231 .cse0))) (let ((.cse222 (store .cse231 .cse0 (store .cse229 .cse17 v_ArrVal_2979))) (.cse226 (store .cse230 .cse0 (store .cse228 .cse17 v_ArrVal_2978))) (.cse223 (select .cse229 .cse1))) (let ((.cse227 (select .cse226 .cse223)) (.cse224 (select .cse222 .cse223)) (.cse216 (select .cse228 .cse1))) (let ((.cse225 (+ .cse216 4)) (.cse217 (select .cse224 .cse216)) (.cse221 (select .cse227 .cse216))) (let ((.cse218 (select (select (store .cse226 .cse223 (store .cse227 .cse225 v_ArrVal_2984)) .cse217) .cse221))) (or (= .cse216 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse217) (= .cse218 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse219 (store .cse222 .cse223 (store .cse224 .cse225 v_ArrVal_2985)))) (let ((.cse220 (select .cse219 .cse217))) (select (store .cse219 .cse217 (store .cse220 (+ 4 .cse221) v_ArrVal_2989)) (select .cse220 .cse221)))) .cse218)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse244 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976))) (.cse247 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977)))) (let ((.cse246 (select .cse247 .cse0)) (.cse245 (select .cse244 .cse0))) (let ((.cse232 (select .cse245 .cse1)) (.cse243 (store .cse247 .cse0 (store .cse246 .cse17 v_ArrVal_2979))) (.cse239 (select .cse246 .cse1))) (let ((.cse242 (select .cse243 .cse239)) (.cse241 (+ .cse232 4)) (.cse238 (store .cse244 .cse0 (store .cse245 .cse17 v_ArrVal_2978)))) (let ((.cse240 (select .cse238 .cse239)) (.cse234 (store .cse243 .cse239 (store .cse242 .cse241 v_ArrVal_2985))) (.cse233 (select .cse242 .cse232))) (let ((.cse235 (select .cse234 .cse233)) (.cse236 (select .cse240 .cse232))) (let ((.cse237 (select .cse235 .cse236))) (or (= .cse232 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse233) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse234 .cse233 (store .cse235 (+ 4 .cse236) v_ArrVal_2989)) .cse237) (select (select (store .cse238 .cse239 (store .cse240 .cse241 v_ArrVal_2984)) .cse233) .cse236))) (= .cse237 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))))))) (forall ((v_ArrVal_2984 Int) (v_ArrVal_2985 Int) (v_ArrVal_2977 Int) (v_ArrVal_2976 Int) (v_ArrVal_2979 Int) (v_ArrVal_2978 Int) (v_ArrVal_2989 Int)) (let ((.cse263 (store .cse22 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse23 .cse21 v_ArrVal_2977))) (.cse262 (store .cse19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 .cse21 v_ArrVal_2976)))) (let ((.cse260 (select .cse262 .cse0)) (.cse261 (select .cse263 .cse0))) (let ((.cse253 (store .cse263 .cse0 (store .cse261 .cse17 v_ArrVal_2979))) (.cse257 (store .cse262 .cse0 (store .cse260 .cse17 v_ArrVal_2978))) (.cse254 (select .cse261 .cse1))) (let ((.cse258 (select .cse257 .cse254)) (.cse255 (select .cse253 .cse254)) (.cse259 (select .cse260 .cse1))) (let ((.cse256 (+ .cse259 4)) (.cse248 (select .cse255 .cse259)) (.cse252 (select .cse258 .cse259))) (let ((.cse249 (select (select (store .cse257 .cse254 (store .cse258 .cse256 v_ArrVal_2984)) .cse248) .cse252))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse248) (= .cse249 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse250 (store .cse253 .cse254 (store .cse255 .cse256 v_ArrVal_2985)))) (let ((.cse251 (select .cse250 .cse248))) (select (store .cse250 .cse248 (store .cse251 (+ 4 .cse252) v_ArrVal_2989)) (select .cse251 .cse252)))) .cse249)) (= .cse254 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))))))))) is different from true