/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/array-fpi/ss2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 20:06:52,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 20:06:52,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 20:06:52,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 20:06:52,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 20:06:52,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 20:06:52,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 20:06:52,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 20:06:52,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 20:06:52,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 20:06:52,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 20:06:52,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 20:06:52,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 20:06:52,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 20:06:52,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 20:06:52,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 20:06:52,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 20:06:52,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 20:06:52,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 20:06:52,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 20:06:52,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 20:06:52,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 20:06:52,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 20:06:52,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 20:06:52,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 20:06:52,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 20:06:52,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 20:06:52,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 20:06:52,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 20:06:52,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 20:06:52,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 20:06:52,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 20:06:52,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 20:06:52,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 20:06:52,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 20:06:52,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 20:06:52,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 20:06:52,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 20:06:52,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 20:06:52,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 20:06:52,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 20:06:52,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 20:06:52,192 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 20:06:52,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 20:06:52,197 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 20:06:52,197 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 20:06:52,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 20:06:52,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 20:06:52,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 20:06:52,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 20:06:52,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 20:06:52,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 20:06:52,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 20:06:52,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 20:06:52,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 20:06:52,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:06:52,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 20:06:52,201 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-01 20:06:52,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 20:06:52,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 20:06:52,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 20:06:52,402 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 20:06:52,403 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 20:06:52,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss2.c [2023-04-01 20:06:53,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 20:06:53,623 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 20:06:53,623 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c [2023-04-01 20:06:53,630 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1fb65c5/1df42706301e4a92b371fd46afcb4c8f/FLAGa8bcd27b6 [2023-04-01 20:06:53,642 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1fb65c5/1df42706301e4a92b371fd46afcb4c8f [2023-04-01 20:06:53,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 20:06:53,644 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 20:06:53,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 20:06:53,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 20:06:53,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 20:06:53,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4711b679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53, skipping insertion in model container [2023-04-01 20:06:53,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 20:06:53,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 20:06:53,745 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c[586,599] [2023-04-01 20:06:53,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:06:53,772 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 20:06:53,779 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss2.c[586,599] [2023-04-01 20:06:53,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:06:53,798 INFO L208 MainTranslator]: Completed translation [2023-04-01 20:06:53,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53 WrapperNode [2023-04-01 20:06:53,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 20:06:53,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 20:06:53,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 20:06:53,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 20:06:53,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,819 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 20:06:53,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 20:06:53,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 20:06:53,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 20:06:53,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (1/1) ... [2023-04-01 20:06:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:06:53,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:06:53,843 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) [2023-04-01 20:06:53,849 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 [2023-04-01 20:06:53,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 20:06:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 20:06:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 20:06:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 20:06:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 20:06:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 20:06:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 20:06:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 20:06:53,915 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 20:06:53,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 20:06:54,219 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 20:06:54,224 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 20:06:54,224 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-04-01 20:06:54,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:06:54 BoogieIcfgContainer [2023-04-01 20:06:54,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 20:06:54,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 20:06:54,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 20:06:54,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 20:06:54,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 08:06:53" (1/3) ... [2023-04-01 20:06:54,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16375d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:06:54, skipping insertion in model container [2023-04-01 20:06:54,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:06:53" (2/3) ... [2023-04-01 20:06:54,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16375d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:06:54, skipping insertion in model container [2023-04-01 20:06:54,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:06:54" (3/3) ... [2023-04-01 20:06:54,232 INFO L112 eAbstractionObserver]: Analyzing ICFG ss2.c [2023-04-01 20:06:54,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 20:06:54,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 20:06:54,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 20:06:54,284 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=PETRI_NET, 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;@7c4c8810, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 20:06:54,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 20:06:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 20:06:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 20:06:54,292 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:06:54,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:06:54,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:06:54,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:06:54,297 INFO L85 PathProgramCache]: Analyzing trace with hash 400584293, now seen corresponding path program 1 times [2023-04-01 20:06:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:06:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050762419] [2023-04-01 20:06:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:06:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:06:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:06:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050762419] [2023-04-01 20:06:54,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 20:06:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213437048] [2023-04-01 20:06:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:06:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:06:54,424 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) [2023-04-01 20:06:54,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 20:06:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:06:54,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-01 20:06:54,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:06:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:06:54,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 20:06:54,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213437048] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:06:54,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:06:54,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 20:06:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869029057] [2023-04-01 20:06:54,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:06:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 20:06:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:06:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 20:06:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 20:06:54,569 INFO L87 Difference]: Start difference. First operand has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:06:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:06:54,583 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2023-04-01 20:06:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 20:06:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-04-01 20:06:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:06:54,588 INFO L225 Difference]: With dead ends: 82 [2023-04-01 20:06:54,588 INFO L226 Difference]: Without dead ends: 41 [2023-04-01 20:06:54,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 20:06:54,591 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:06:54,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 20:06:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-04-01 20:06:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-04-01 20:06:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:06:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-04-01 20:06:54,614 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2023-04-01 20:06:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:06:54,614 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-04-01 20:06:54,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:06:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2023-04-01 20:06:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 20:06:54,615 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:06:54,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:06:54,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 20:06:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-04-01 20:06:54,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:06:54,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:06:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2048023515, now seen corresponding path program 1 times [2023-04-01 20:06:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:06:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394729420] [2023-04-01 20:06:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:06:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:06:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:06:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394729420] [2023-04-01 20:06:54,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 20:06:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725888358] [2023-04-01 20:06:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:54,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:06:54,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:06:54,914 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) [2023-04-01 20:06:54,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 20:06:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:06:55,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 20:06:55,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:06:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:06:55,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 20:06:55,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725888358] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:06:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:06:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 20:06:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342582953] [2023-04-01 20:06:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:06:55,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 20:06:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:06:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 20:06:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 20:06:55,111 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:06:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:06:55,184 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2023-04-01 20:06:55,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 20:06:55,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-04-01 20:06:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:06:55,187 INFO L225 Difference]: With dead ends: 83 [2023-04-01 20:06:55,187 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 20:06:55,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 20:06:55,188 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:06:55,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:06:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 20:06:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2023-04-01 20:06:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:06:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2023-04-01 20:06:55,195 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2023-04-01 20:06:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:06:55,196 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2023-04-01 20:06:55,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:06:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2023-04-01 20:06:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-01 20:06:55,196 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:06:55,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:06:55,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 20:06:55,400 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,SelfDestructingSolverStorable1 [2023-04-01 20:06:55,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:06:55,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:06:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1404248049, now seen corresponding path program 1 times [2023-04-01 20:06:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:06:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116185469] [2023-04-01 20:06:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:06:55,426 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:06:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370456862] [2023-04-01 20:06:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:06:55,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:06:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:06:55,427 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) [2023-04-01 20:06:55,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 20:06:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:06:55,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 66 conjunts are in the unsatisfiable core [2023-04-01 20:06:55,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:06:55,584 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-04-01 20:06:55,596 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-04-01 20:06:55,641 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-01 20:06:55,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 20:06:55,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 20:06:55,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 20:06:56,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 20:06:56,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 20:06:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:06:56,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:06:57,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 20:06:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:06:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:06:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116185469] [2023-04-01 20:06:58,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:06:58,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370456862] [2023-04-01 20:06:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370456862] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:06:58,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:06:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2023-04-01 20:06:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101060119] [2023-04-01 20:06:58,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:06:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-04-01 20:06:58,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:06:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-04-01 20:06:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1640, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 20:06:58,282 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 44 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:07:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:07:06,544 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2023-04-01 20:07:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-04-01 20:07:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-04-01 20:07:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:07:06,546 INFO L225 Difference]: With dead ends: 122 [2023-04-01 20:07:06,546 INFO L226 Difference]: Without dead ends: 103 [2023-04-01 20:07:06,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=601, Invalid=3689, Unknown=0, NotChecked=0, Total=4290 [2023-04-01 20:07:06,562 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 254 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:07:06,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 420 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-04-01 20:07:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-04-01 20:07:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2023-04-01 20:07:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 70 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 20:07:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-04-01 20:07:06,583 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 42 [2023-04-01 20:07:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:07:06,583 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-04-01 20:07:06,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:07:06,583 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-04-01 20:07:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-04-01 20:07:06,584 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:07:06,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:07:06,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 20:07:06,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:06,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:07:06,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:07:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1374805811, now seen corresponding path program 2 times [2023-04-01 20:07:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:07:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639196801] [2023-04-01 20:07:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:07:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:07:06,813 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:07:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060430737] [2023-04-01 20:07:06,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:07:06,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:07:06,829 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) [2023-04-01 20:07:06,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 20:07:06,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:07:06,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:07:06,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 20:07:06,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:07:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 20:07:06,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:07:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 20:07:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:07:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639196801] [2023-04-01 20:07:06,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:07:06,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060430737] [2023-04-01 20:07:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060430737] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:07:06,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:07:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-04-01 20:07:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962395739] [2023-04-01 20:07:06,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:07:06,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 20:07:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:07:06,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 20:07:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-01 20:07:06,979 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:07:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:07:07,191 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2023-04-01 20:07:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 20:07:07,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-04-01 20:07:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:07:07,193 INFO L225 Difference]: With dead ends: 164 [2023-04-01 20:07:07,194 INFO L226 Difference]: Without dead ends: 120 [2023-04-01 20:07:07,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-04-01 20:07:07,198 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:07:07,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 136 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:07:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-04-01 20:07:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2023-04-01 20:07:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.180722891566265) internal successors, (98), 84 states have internal predecessors, (98), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 20:07:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-04-01 20:07:07,263 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 44 [2023-04-01 20:07:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:07:07,263 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-04-01 20:07:07,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:07:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-04-01 20:07:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-04-01 20:07:07,270 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:07:07,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:07:07,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 20:07:07,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:07,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:07:07,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:07:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1600932299, now seen corresponding path program 3 times [2023-04-01 20:07:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:07:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881297870] [2023-04-01 20:07:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:07:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:07:07,499 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:07:07,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716332279] [2023-04-01 20:07:07,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:07:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:07:07,501 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) [2023-04-01 20:07:07,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 20:07:07,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 20:07:07,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:07:07,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 20:07:07,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:07:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 20:07:07,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:07:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 20:07:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:07:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881297870] [2023-04-01 20:07:07,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:07:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716332279] [2023-04-01 20:07:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716332279] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:07:07,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:07:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-04-01 20:07:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823001548] [2023-04-01 20:07:07,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:07:07,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 20:07:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:07:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 20:07:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-04-01 20:07:07,674 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:07:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:07:07,821 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2023-04-01 20:07:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 20:07:07,821 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2023-04-01 20:07:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:07:07,822 INFO L225 Difference]: With dead ends: 154 [2023-04-01 20:07:07,822 INFO L226 Difference]: Without dead ends: 73 [2023-04-01 20:07:07,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:07:07,823 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:07:07,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 100 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:07:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-04-01 20:07:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2023-04-01 20:07:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 20:07:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-04-01 20:07:07,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 46 [2023-04-01 20:07:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:07:07,832 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-04-01 20:07:07,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:07:07,833 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-04-01 20:07:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 20:07:07,833 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:07:07,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 20:07:07,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 20:07:08,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:08,038 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:07:08,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:07:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -436238781, now seen corresponding path program 4 times [2023-04-01 20:07:08,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:07:08,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229756485] [2023-04-01 20:07:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:07:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:07:08,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:07:08,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890741648] [2023-04-01 20:07:08,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:07:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:07:08,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:07:08,063 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) [2023-04-01 20:07:08,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 20:07:08,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:07:08,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:07:08,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 100 conjunts are in the unsatisfiable core [2023-04-01 20:07:08,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:07:08,246 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-04-01 20:07:08,251 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-04-01 20:07:08,273 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-04-01 20:07:08,321 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:07:08,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-04-01 20:07:08,431 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-04-01 20:07:08,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 35 [2023-04-01 20:07:08,505 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 20:07:08,636 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-01 20:07:08,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 31 [2023-04-01 20:07:08,720 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:07:08,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 20:07:08,817 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-04-01 20:07:08,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 35 [2023-04-01 20:07:08,899 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 20:07:09,014 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 20:07:09,123 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-01 20:07:09,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 31 [2023-04-01 20:07:09,220 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-04-01 20:07:09,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 31 [2023-04-01 20:07:09,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:07:09,324 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-04-01 20:07:09,324 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 44 [2023-04-01 20:07:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:07:09,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:07:21,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 20:07:21,182 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 20:07:21,185 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-01 20:07:21,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 311 treesize of output 1 [2023-04-01 20:07:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:07:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:07:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229756485] [2023-04-01 20:07:21,191 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:07:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890741648] [2023-04-01 20:07:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890741648] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:07:21,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:07:21,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 67 [2023-04-01 20:07:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532243405] [2023-04-01 20:07:21,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:07:21,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-04-01 20:07:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:07:21,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-04-01 20:07:21,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=4014, Unknown=0, NotChecked=0, Total=4422 [2023-04-01 20:07:21,194 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 67 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-01 20:07:42,446 WARN L223 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 320 DAG size of output: 231 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:07:56,596 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse101 (* c_main_~i~0 8))) (let ((.cse10 (select |c_#memory_int| c_main_~a~0.base)) (.cse103 (+ c_main_~a~0.offset .cse101)) (.cse41 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse43 (select .cse41 |c_main_~#sum~0.offset|)) (.cse100 (select .cse10 .cse103))) (let ((.cse51 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse41 |c_main_~#sum~0.offset| (+ .cse43 .cse100)))) (.cse102 (+ c_main_~i~0 1))) (let ((.cse44 (<= c_~N~0 c_main_~i~0)) (.cse11 (< .cse102 c_~N~0)) (.cse28 (store .cse10 .cse103 1)) (.cse12 (< 2 c_~N~0)) (.cse30 (<= c_~N~0 1)) (.cse13 (<= c_~N~0 .cse102)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse54 (select .cse51 c_main_~a~0.base)) (.cse29 (+ c_main_~a~0.offset .cse101 8)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse31 (< (+ c_main_~i~0 2) c_~N~0))) (and (or (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse9 (store (store .cse10 c_main_~a~0.offset 0) .cse7 0))) (let ((.cse2 (select (select (store |c_#memory_int| c_main_~a~0.base .cse9) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base (let ((.cse8 (store .cse9 c_main_~a~0.offset .cse2))) (store .cse8 .cse7 (select (select (store |c_#memory_int| c_main_~a~0.base .cse8) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse4))) c_main_~a~0.base) .cse7))) (let ((.cse1 (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (+ .cse2 .cse3 .cse4 (select .cse1 c_main_~a~0.offset)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse11) (or .cse12 .cse13 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse20 (let ((.cse27 (store .cse28 .cse29 1))) (let ((.cse23 (store |c_#memory_int| c_main_~a~0.base .cse27))) (store .cse23 |c_main_~#sum~0.base| (let ((.cse24 (select .cse23 |c_main_~#sum~0.base|))) (store .cse24 |c_main_~#sum~0.offset| (let ((.cse25 (select .cse24 |c_main_~#sum~0.offset|)) (.cse26 (select .cse27 c_main_~a~0.offset))) (+ .cse25 .cse26 (select (select (store .cse23 |c_main_~#sum~0.base| (store .cse24 |c_main_~#sum~0.offset| (+ .cse25 .cse26))) c_main_~a~0.base) .cse7)))))))))) (let ((.cse22 (store (store (select .cse20 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse15 (select (select (store .cse20 c_main_~a~0.base .cse22) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse18 (store .cse20 c_main_~a~0.base (let ((.cse21 (store .cse22 c_main_~a~0.offset .cse15))) (store .cse21 .cse7 (select (select (store .cse20 c_main_~a~0.base .cse21) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.base|))) (let ((.cse17 (select .cse19 |c_main_~#sum~0.offset|))) (let ((.cse16 (select (select (store .cse18 |c_main_~#sum~0.base| (store .cse19 |c_main_~#sum~0.offset| (+ .cse15 .cse17))) c_main_~a~0.base) .cse7))) (let ((.cse14 (select (store .cse18 |c_main_~#sum~0.base| (store .cse19 |c_main_~#sum~0.offset| (+ .cse15 .cse16 .cse17))) c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ .cse15 .cse16 .cse17 (select .cse14 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse30 .cse31) (or .cse12 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse38 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse41 |c_main_~#sum~0.offset| (let ((.cse42 (select .cse10 c_main_~a~0.offset))) (+ .cse42 .cse43 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse41 |c_main_~#sum~0.offset| (+ .cse42 .cse43))) c_main_~a~0.base) .cse7))))))) (let ((.cse40 (store (store (select .cse38 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse33 (select (select (store .cse38 c_main_~a~0.base .cse40) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse36 (store .cse38 c_main_~a~0.base (let ((.cse39 (store .cse40 c_main_~a~0.offset .cse33))) (store .cse39 .cse7 (select (select (store .cse38 c_main_~a~0.base .cse39) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse37 (select .cse36 |c_main_~#sum~0.base|))) (let ((.cse34 (select .cse37 |c_main_~#sum~0.offset|))) (let ((.cse35 (select (select (store .cse36 |c_main_~#sum~0.base| (store .cse37 |c_main_~#sum~0.offset| (+ .cse33 .cse34))) c_main_~a~0.base) .cse7))) (let ((.cse32 (select (store .cse36 |c_main_~#sum~0.base| (store .cse37 |c_main_~#sum~0.offset| (+ .cse33 .cse34 .cse35))) c_main_~a~0.base))) (store .cse32 c_main_~a~0.offset (+ .cse33 .cse34 (select .cse32 c_main_~a~0.offset) .cse35)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse30 .cse11) (or .cse44 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse53 (store (store .cse54 c_main_~a~0.offset 0) .cse7 0))) (let ((.cse48 (select (select (store .cse51 c_main_~a~0.base .cse53) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse49 (store .cse51 c_main_~a~0.base (let ((.cse52 (store .cse53 c_main_~a~0.offset .cse48))) (store .cse52 .cse7 (select (select (store .cse51 c_main_~a~0.base .cse52) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse50 (select .cse49 |c_main_~#sum~0.base|))) (let ((.cse46 (select .cse50 |c_main_~#sum~0.offset|))) (let ((.cse47 (select (select (store .cse49 |c_main_~#sum~0.base| (store .cse50 |c_main_~#sum~0.offset| (+ .cse46 .cse48))) c_main_~a~0.base) .cse7))) (let ((.cse45 (select (store .cse49 |c_main_~#sum~0.base| (store .cse50 |c_main_~#sum~0.offset| (+ .cse46 .cse47 .cse48))) c_main_~a~0.base))) (store .cse45 c_main_~a~0.offset (+ .cse46 .cse47 (select .cse45 c_main_~a~0.offset) .cse48))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse11) (or (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse61 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse41 |c_main_~#sum~0.offset| (+ (select .cse10 .cse29) .cse43))))) (let ((.cse63 (store (store (select .cse61 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse56 (select (select (store .cse61 c_main_~a~0.base .cse63) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse59 (store .cse61 c_main_~a~0.base (let ((.cse62 (store .cse63 c_main_~a~0.offset .cse56))) (store .cse62 .cse7 (select (select (store .cse61 c_main_~a~0.base .cse62) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse60 (select .cse59 |c_main_~#sum~0.base|))) (let ((.cse58 (select .cse60 |c_main_~#sum~0.offset|))) (let ((.cse57 (select (select (store .cse59 |c_main_~#sum~0.base| (store .cse60 |c_main_~#sum~0.offset| (+ .cse56 .cse58))) c_main_~a~0.base) .cse7))) (let ((.cse55 (select (store .cse59 |c_main_~#sum~0.base| (store .cse60 |c_main_~#sum~0.offset| (+ .cse56 .cse57 .cse58))) c_main_~a~0.base))) (store .cse55 c_main_~a~0.offset (+ .cse56 .cse57 .cse58 (select .cse55 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse13 .cse31) (or .cse12 .cse30 .cse44 .cse11 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse70 (let ((.cse73 (store |c_#memory_int| c_main_~a~0.base .cse28))) (store .cse73 |c_main_~#sum~0.base| (let ((.cse74 (select .cse73 |c_main_~#sum~0.base|))) (store .cse74 |c_main_~#sum~0.offset| (let ((.cse75 (select .cse28 c_main_~a~0.offset)) (.cse76 (select .cse74 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse73 |c_main_~#sum~0.base| (store .cse74 |c_main_~#sum~0.offset| (+ .cse75 .cse76))) c_main_~a~0.base) .cse7) .cse75 .cse76)))))))) (let ((.cse72 (store (store (select .cse70 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse67 (select (select (store .cse70 c_main_~a~0.base .cse72) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse68 (store .cse70 c_main_~a~0.base (let ((.cse71 (store .cse72 c_main_~a~0.offset .cse67))) (store .cse71 .cse7 (select (select (store .cse70 c_main_~a~0.base .cse71) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse69 (select .cse68 |c_main_~#sum~0.base|))) (let ((.cse65 (select .cse69 |c_main_~#sum~0.offset|))) (let ((.cse66 (select (select (store .cse68 |c_main_~#sum~0.base| (store .cse69 |c_main_~#sum~0.offset| (+ .cse65 .cse67))) c_main_~a~0.base) .cse7))) (let ((.cse64 (select (store .cse68 |c_main_~#sum~0.base| (store .cse69 |c_main_~#sum~0.offset| (+ .cse65 .cse66 .cse67))) c_main_~a~0.base))) (store .cse64 c_main_~a~0.offset (+ .cse65 .cse66 .cse67 (select .cse64 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1)))) (< 0 c_~N~0) (or .cse12 .cse13 .cse30 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse83 (let ((.cse90 (store .cse10 .cse29 1))) (let ((.cse86 (store |c_#memory_int| c_main_~a~0.base .cse90))) (store .cse86 |c_main_~#sum~0.base| (let ((.cse87 (select .cse86 |c_main_~#sum~0.base|))) (store .cse87 |c_main_~#sum~0.offset| (let ((.cse88 (select .cse90 c_main_~a~0.offset)) (.cse89 (select .cse87 |c_main_~#sum~0.offset|))) (+ .cse88 .cse89 (select (select (store .cse86 |c_main_~#sum~0.base| (store .cse87 |c_main_~#sum~0.offset| (+ .cse88 .cse89))) c_main_~a~0.base) .cse7)))))))))) (let ((.cse85 (store (store (select .cse83 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse79 (select (select (store .cse83 c_main_~a~0.base .cse85) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse81 (store .cse83 c_main_~a~0.base (let ((.cse84 (store .cse85 c_main_~a~0.offset .cse79))) (store .cse84 .cse7 (select (select (store .cse83 c_main_~a~0.base .cse84) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse82 (select .cse81 |c_main_~#sum~0.base|))) (let ((.cse78 (select .cse82 |c_main_~#sum~0.offset|))) (let ((.cse80 (select (select (store .cse81 |c_main_~#sum~0.base| (store .cse82 |c_main_~#sum~0.offset| (+ .cse78 .cse79))) c_main_~a~0.base) .cse7))) (let ((.cse77 (select (store .cse81 |c_main_~#sum~0.base| (store .cse82 |c_main_~#sum~0.offset| (+ .cse78 .cse79 .cse80))) c_main_~a~0.base))) (store .cse77 c_main_~a~0.offset (+ .cse78 .cse79 .cse80 (select .cse77 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse31) (or .cse13 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= (select (store (let ((.cse97 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse41 |c_main_~#sum~0.offset| (+ .cse43 .cse100 (select .cse54 .cse29)))))) (let ((.cse99 (store (store (select .cse97 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse94 (select (select (store .cse97 c_main_~a~0.base .cse99) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse95 (store .cse97 c_main_~a~0.base (let ((.cse98 (store .cse99 c_main_~a~0.offset .cse94))) (store .cse98 .cse7 (select (select (store .cse97 c_main_~a~0.base .cse98) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse96 (select .cse95 |c_main_~#sum~0.base|))) (let ((.cse92 (select .cse96 |c_main_~#sum~0.offset|))) (let ((.cse93 (select (select (store .cse95 |c_main_~#sum~0.base| (store .cse96 |c_main_~#sum~0.offset| (+ .cse92 .cse94))) c_main_~a~0.base) .cse7))) (let ((.cse91 (select (store .cse95 |c_main_~#sum~0.base| (store .cse96 |c_main_~#sum~0.offset| (+ .cse92 .cse93 .cse94))) c_main_~a~0.base))) (store .cse91 c_main_~a~0.offset (+ .cse92 .cse93 (select .cse91 c_main_~a~0.offset) .cse94)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset) .cse0))) .cse31))))))) is different from true [2023-04-01 20:08:02,195 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse91 (* c_main_~i~0 8))) (let ((.cse42 (select |c_#memory_int| c_main_~a~0.base)) (.cse93 (+ c_main_~a~0.offset .cse91)) (.cse52 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse53 (select .cse52 |c_main_~#sum~0.offset|)) (.cse90 (select .cse42 .cse93))) (let ((.cse29 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse53 .cse90)))) (.cse92 (+ c_main_~i~0 1))) (let ((.cse22 (<= c_~N~0 c_main_~i~0)) (.cse33 (< .cse92 c_~N~0)) (.cse18 (store .cse42 .cse93 1)) (.cse0 (< 2 c_~N~0)) (.cse20 (<= c_~N~0 1)) (.cse1 (<= c_~N~0 .cse92)) (.cse9 (+ c_main_~a~0.offset 8)) (.cse32 (select .cse29 c_main_~a~0.base)) (.cse19 (+ c_main_~a~0.offset .cse91 8)) (.cse2 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse21 (< (+ c_main_~i~0 2) c_~N~0))) (and (or .cse0 .cse1 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse2 (select (store (let ((.cse10 (let ((.cse17 (store .cse18 .cse19 1))) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base .cse17))) (store .cse13 |c_main_~#sum~0.base| (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (store .cse14 |c_main_~#sum~0.offset| (let ((.cse15 (select .cse14 |c_main_~#sum~0.offset|)) (.cse16 (select .cse17 c_main_~a~0.offset))) (+ .cse15 .cse16 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse15 .cse16))) c_main_~a~0.base) .cse9)))))))))) (let ((.cse12 (store (store (select .cse10 c_main_~a~0.base) c_main_~a~0.offset 0) .cse9 0))) (let ((.cse4 (select (select (store .cse10 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse7 (store .cse10 c_main_~a~0.base (let ((.cse11 (store .cse12 c_main_~a~0.offset .cse4))) (store .cse11 .cse9 (select (select (store .cse10 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse8 |c_main_~#sum~0.offset|))) (let ((.cse5 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse6))) c_main_~a~0.base) .cse9))) (let ((.cse3 (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse4 .cse5 .cse6))) c_main_~a~0.base))) (store .cse3 c_main_~a~0.offset (+ .cse4 .cse5 .cse6 (select .cse3 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse20 .cse21) (or .cse22 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse2 (select (store (let ((.cse31 (store (store .cse32 c_main_~a~0.offset 0) .cse9 0))) (let ((.cse26 (select (select (store .cse29 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse27 (store .cse29 c_main_~a~0.base (let ((.cse30 (store .cse31 c_main_~a~0.offset .cse26))) (store .cse30 .cse9 (select (select (store .cse29 c_main_~a~0.base .cse30) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse28 (select .cse27 |c_main_~#sum~0.base|))) (let ((.cse24 (select .cse28 |c_main_~#sum~0.offset|))) (let ((.cse25 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse24 .cse26))) c_main_~a~0.base) .cse9))) (let ((.cse23 (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ .cse24 .cse25 .cse26))) c_main_~a~0.base))) (store .cse23 c_main_~a~0.offset (+ .cse24 .cse25 (select .cse23 c_main_~a~0.offset) .cse26))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse33) (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse2 (select (store (let ((.cse41 (store (store .cse42 c_main_~a~0.offset 0) .cse9 0))) (let ((.cse35 (select (select (store |c_#memory_int| c_main_~a~0.base .cse41) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse38 (store |c_#memory_int| c_main_~a~0.base (let ((.cse40 (store .cse41 c_main_~a~0.offset .cse35))) (store .cse40 .cse9 (select (select (store |c_#memory_int| c_main_~a~0.base .cse40) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse39 (select .cse38 |c_main_~#sum~0.base|))) (let ((.cse37 (select .cse39 |c_main_~#sum~0.offset|))) (let ((.cse36 (select (select (store .cse38 |c_main_~#sum~0.base| (store .cse39 |c_main_~#sum~0.offset| (+ .cse35 .cse37))) c_main_~a~0.base) .cse9))) (let ((.cse34 (select (store .cse38 |c_main_~#sum~0.base| (store .cse39 |c_main_~#sum~0.offset| (+ .cse35 .cse36 .cse37))) c_main_~a~0.base))) (store .cse34 c_main_~a~0.offset (+ .cse35 .cse36 .cse37 (select .cse34 c_main_~a~0.offset)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) (or (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse2 (select (store (let ((.cse49 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ (select .cse42 .cse19) .cse53))))) (let ((.cse51 (store (store (select .cse49 c_main_~a~0.base) c_main_~a~0.offset 0) .cse9 0))) (let ((.cse44 (select (select (store .cse49 c_main_~a~0.base .cse51) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse47 (store .cse49 c_main_~a~0.base (let ((.cse50 (store .cse51 c_main_~a~0.offset .cse44))) (store .cse50 .cse9 (select (select (store .cse49 c_main_~a~0.base .cse50) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse48 (select .cse47 |c_main_~#sum~0.base|))) (let ((.cse46 (select .cse48 |c_main_~#sum~0.offset|))) (let ((.cse45 (select (select (store .cse47 |c_main_~#sum~0.base| (store .cse48 |c_main_~#sum~0.offset| (+ .cse44 .cse46))) c_main_~a~0.base) .cse9))) (let ((.cse43 (select (store .cse47 |c_main_~#sum~0.base| (store .cse48 |c_main_~#sum~0.offset| (+ .cse44 .cse45 .cse46))) c_main_~a~0.base))) (store .cse43 c_main_~a~0.offset (+ .cse44 .cse45 .cse46 (select .cse43 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse1 .cse21) (or .cse0 .cse20 .cse22 .cse33 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse2 (select (store (let ((.cse60 (let ((.cse63 (store |c_#memory_int| c_main_~a~0.base .cse18))) (store .cse63 |c_main_~#sum~0.base| (let ((.cse64 (select .cse63 |c_main_~#sum~0.base|))) (store .cse64 |c_main_~#sum~0.offset| (let ((.cse65 (select .cse18 c_main_~a~0.offset)) (.cse66 (select .cse64 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse63 |c_main_~#sum~0.base| (store .cse64 |c_main_~#sum~0.offset| (+ .cse65 .cse66))) c_main_~a~0.base) .cse9) .cse65 .cse66)))))))) (let ((.cse62 (store (store (select .cse60 c_main_~a~0.base) c_main_~a~0.offset 0) .cse9 0))) (let ((.cse57 (select (select (store .cse60 c_main_~a~0.base .cse62) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse58 (store .cse60 c_main_~a~0.base (let ((.cse61 (store .cse62 c_main_~a~0.offset .cse57))) (store .cse61 .cse9 (select (select (store .cse60 c_main_~a~0.base .cse61) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse59 (select .cse58 |c_main_~#sum~0.base|))) (let ((.cse55 (select .cse59 |c_main_~#sum~0.offset|))) (let ((.cse56 (select (select (store .cse58 |c_main_~#sum~0.base| (store .cse59 |c_main_~#sum~0.offset| (+ .cse55 .cse57))) c_main_~a~0.base) .cse9))) (let ((.cse54 (select (store .cse58 |c_main_~#sum~0.base| (store .cse59 |c_main_~#sum~0.offset| (+ .cse55 .cse56 .cse57))) c_main_~a~0.base))) (store .cse54 c_main_~a~0.offset (+ .cse55 .cse56 .cse57 (select .cse54 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1)))) (or .cse0 .cse1 .cse20 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse2 (select (store (let ((.cse73 (let ((.cse80 (store .cse42 .cse19 1))) (let ((.cse76 (store |c_#memory_int| c_main_~a~0.base .cse80))) (store .cse76 |c_main_~#sum~0.base| (let ((.cse77 (select .cse76 |c_main_~#sum~0.base|))) (store .cse77 |c_main_~#sum~0.offset| (let ((.cse78 (select .cse80 c_main_~a~0.offset)) (.cse79 (select .cse77 |c_main_~#sum~0.offset|))) (+ .cse78 .cse79 (select (select (store .cse76 |c_main_~#sum~0.base| (store .cse77 |c_main_~#sum~0.offset| (+ .cse78 .cse79))) c_main_~a~0.base) .cse9)))))))))) (let ((.cse75 (store (store (select .cse73 c_main_~a~0.base) c_main_~a~0.offset 0) .cse9 0))) (let ((.cse69 (select (select (store .cse73 c_main_~a~0.base .cse75) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse71 (store .cse73 c_main_~a~0.base (let ((.cse74 (store .cse75 c_main_~a~0.offset .cse69))) (store .cse74 .cse9 (select (select (store .cse73 c_main_~a~0.base .cse74) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse72 (select .cse71 |c_main_~#sum~0.base|))) (let ((.cse68 (select .cse72 |c_main_~#sum~0.offset|))) (let ((.cse70 (select (select (store .cse71 |c_main_~#sum~0.base| (store .cse72 |c_main_~#sum~0.offset| (+ .cse68 .cse69))) c_main_~a~0.base) .cse9))) (let ((.cse67 (select (store .cse71 |c_main_~#sum~0.base| (store .cse72 |c_main_~#sum~0.offset| (+ .cse68 .cse69 .cse70))) c_main_~a~0.base))) (store .cse67 c_main_~a~0.offset (+ .cse68 .cse69 .cse70 (select .cse67 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse21) (or .cse1 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= (select (store (let ((.cse87 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse53 .cse90 (select .cse32 .cse19)))))) (let ((.cse89 (store (store (select .cse87 c_main_~a~0.base) c_main_~a~0.offset 0) .cse9 0))) (let ((.cse84 (select (select (store .cse87 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse85 (store .cse87 c_main_~a~0.base (let ((.cse88 (store .cse89 c_main_~a~0.offset .cse84))) (store .cse88 .cse9 (select (select (store .cse87 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse86 (select .cse85 |c_main_~#sum~0.base|))) (let ((.cse82 (select .cse86 |c_main_~#sum~0.offset|))) (let ((.cse83 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse84))) c_main_~a~0.base) .cse9))) (let ((.cse81 (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse83 .cse84))) c_main_~a~0.base))) (store .cse81 c_main_~a~0.offset (+ .cse82 .cse83 (select .cse81 c_main_~a~0.offset) .cse84)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset) .cse2))) .cse21))))))) is different from true [2023-04-01 20:08:17,493 WARN L223 SmtUtils]: Spent 11.80s on a formula simplification. DAG size of input: 309 DAG size of output: 219 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:08:29,331 WARN L223 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 279 DAG size of output: 189 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:08:43,469 WARN L223 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 219 DAG size of output: 174 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:08:53,859 WARN L223 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:09:33,300 WARN L223 SmtUtils]: Spent 31.99s on a formula simplification. DAG size of input: 253 DAG size of output: 208 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:09:56,899 WARN L223 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 278 DAG size of output: 189 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:10:08,047 WARN L223 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 162 DAG size of output: 161 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:10:36,733 WARN L223 SmtUtils]: Spent 16.08s on a formula simplification. DAG size of input: 307 DAG size of output: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:10:59,677 WARN L223 SmtUtils]: Spent 15.73s on a formula simplification. DAG size of input: 308 DAG size of output: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:11:36,681 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse109 (* c_main_~i~0 8))) (let ((.cse9 (select |c_#memory_int| c_main_~a~0.base)) (.cse107 (+ c_main_~a~0.offset .cse109)) (.cse12 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse104 (select .cse12 |c_main_~#sum~0.offset|)) (.cse105 (select .cse9 .cse107))) (let ((.cse108 (+ .cse104 .cse105))) (let ((.cse50 (store .cse9 .cse107 .cse108))) (let ((.cse48 (store |c_#memory_int| c_main_~a~0.base .cse50)) (.cse10 (+ c_main_~a~0.offset .cse109 8))) (let ((.cse39 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| .cse108))) (.cse106 (+ c_main_~i~0 1)) (.cse58 (select .cse9 .cse10)) (.cse49 (select .cse48 |c_main_~#sum~0.base|))) (let ((.cse46 (select .cse49 |c_main_~#sum~0.offset|)) (.cse11 (+ .cse58 .cse104)) (.cse32 (<= c_~N~0 c_main_~i~0)) (.cse43 (< .cse106 c_~N~0)) (.cse29 (store .cse9 .cse107 1)) (.cse13 (< 2 c_~N~0)) (.cse30 (<= c_~N~0 1)) (.cse14 (<= c_~N~0 .cse106)) (.cse7 (+ c_main_~a~0.offset 8)) (.cse42 (select .cse39 c_main_~a~0.base)) (.cse0 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse31 (< (+ c_main_~i~0 2) c_~N~0))) (and (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse8 (store .cse9 .cse10 .cse11))) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base .cse8))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse8 c_main_~a~0.offset)) (.cse3 (select .cse6 |c_main_~#sum~0.offset|))) (let ((.cse4 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) .cse7))) (let ((.cse1 (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse2 .cse3 .cse4))) c_main_~a~0.base))) (store .cse1 c_main_~a~0.offset (+ (select .cse1 c_main_~a~0.offset) .cse2 .cse3 .cse4)))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) (<= c_~N~0 2) (= (select .cse9 0) 2) (= 2 (select .cse12 0)) (or .cse13 .cse14 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse21 (let ((.cse28 (store .cse29 .cse10 1))) (let ((.cse24 (store |c_#memory_int| c_main_~a~0.base .cse28))) (store .cse24 |c_main_~#sum~0.base| (let ((.cse25 (select .cse24 |c_main_~#sum~0.base|))) (store .cse25 |c_main_~#sum~0.offset| (let ((.cse26 (select .cse25 |c_main_~#sum~0.offset|)) (.cse27 (select .cse28 c_main_~a~0.offset))) (+ .cse26 .cse27 (select (select (store .cse24 |c_main_~#sum~0.base| (store .cse25 |c_main_~#sum~0.offset| (+ .cse26 .cse27))) c_main_~a~0.base) .cse7)))))))))) (let ((.cse23 (store (store (select .cse21 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse16 (select (select (store .cse21 c_main_~a~0.base .cse23) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse19 (store .cse21 c_main_~a~0.base (let ((.cse22 (store .cse23 c_main_~a~0.offset .cse16))) (store .cse22 .cse7 (select (select (store .cse21 c_main_~a~0.base .cse22) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse20 (select .cse19 |c_main_~#sum~0.base|))) (let ((.cse18 (select .cse20 |c_main_~#sum~0.offset|))) (let ((.cse17 (select (select (store .cse19 |c_main_~#sum~0.base| (store .cse20 |c_main_~#sum~0.offset| (+ .cse16 .cse18))) c_main_~a~0.base) .cse7))) (let ((.cse15 (select (store .cse19 |c_main_~#sum~0.base| (store .cse20 |c_main_~#sum~0.offset| (+ .cse16 .cse17 .cse18))) c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ .cse16 .cse17 .cse18 (select .cse15 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse30 .cse31) (= 2 (select .cse9 8)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (or .cse32 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse41 (store (store .cse42 c_main_~a~0.offset 0) .cse7 0))) (let ((.cse36 (select (select (store .cse39 c_main_~a~0.base .cse41) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse37 (store .cse39 c_main_~a~0.base (let ((.cse40 (store .cse41 c_main_~a~0.offset .cse36))) (store .cse40 .cse7 (select (select (store .cse39 c_main_~a~0.base .cse40) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse38 (select .cse37 |c_main_~#sum~0.base|))) (let ((.cse34 (select .cse38 |c_main_~#sum~0.offset|))) (let ((.cse35 (select (select (store .cse37 |c_main_~#sum~0.base| (store .cse38 |c_main_~#sum~0.offset| (+ .cse34 .cse36))) c_main_~a~0.base) .cse7))) (let ((.cse33 (select (store .cse37 |c_main_~#sum~0.base| (store .cse38 |c_main_~#sum~0.offset| (+ .cse34 .cse35 .cse36))) c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 .cse35 (select .cse33 c_main_~a~0.offset) .cse36))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse43) (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse45 (select .cse50 c_main_~a~0.offset))) (let ((.cse47 (select (select (store .cse48 |c_main_~#sum~0.base| (store .cse49 |c_main_~#sum~0.offset| (+ .cse45 .cse46))) c_main_~a~0.base) .cse7))) (let ((.cse44 (select (store .cse48 |c_main_~#sum~0.base| (store .cse49 |c_main_~#sum~0.offset| (+ .cse45 .cse46 .cse47))) c_main_~a~0.base))) (store .cse44 c_main_~a~0.offset (+ .cse45 .cse46 .cse47 (select .cse44 c_main_~a~0.offset)))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) (= |c_main_~#sum~0.offset| 0) (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse57 (store .cse50 .cse10 (+ .cse58 .cse46)))) (let ((.cse55 (store |c_#memory_int| c_main_~a~0.base .cse57))) (let ((.cse56 (select .cse55 |c_main_~#sum~0.base|))) (let ((.cse53 (select .cse57 c_main_~a~0.offset)) (.cse54 (select .cse56 |c_main_~#sum~0.offset|))) (let ((.cse52 (select (select (store .cse55 |c_main_~#sum~0.base| (store .cse56 |c_main_~#sum~0.offset| (+ .cse53 .cse54))) c_main_~a~0.base) .cse7))) (let ((.cse51 (select (store .cse55 |c_main_~#sum~0.base| (store .cse56 |c_main_~#sum~0.offset| (+ .cse52 .cse53 .cse54))) c_main_~a~0.base))) (store .cse51 c_main_~a~0.offset (+ .cse52 (select .cse51 c_main_~a~0.offset) .cse53 .cse54)))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) (or (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse65 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| .cse11)))) (let ((.cse67 (store (store (select .cse65 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse60 (select (select (store .cse65 c_main_~a~0.base .cse67) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse63 (store .cse65 c_main_~a~0.base (let ((.cse66 (store .cse67 c_main_~a~0.offset .cse60))) (store .cse66 .cse7 (select (select (store .cse65 c_main_~a~0.base .cse66) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse64 (select .cse63 |c_main_~#sum~0.base|))) (let ((.cse62 (select .cse64 |c_main_~#sum~0.offset|))) (let ((.cse61 (select (select (store .cse63 |c_main_~#sum~0.base| (store .cse64 |c_main_~#sum~0.offset| (+ .cse60 .cse62))) c_main_~a~0.base) .cse7))) (let ((.cse59 (select (store .cse63 |c_main_~#sum~0.base| (store .cse64 |c_main_~#sum~0.offset| (+ .cse60 .cse61 .cse62))) c_main_~a~0.base))) (store .cse59 c_main_~a~0.offset (+ .cse60 .cse61 .cse62 (select .cse59 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse14 .cse31) (or .cse13 .cse30 .cse32 .cse43 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse0 (select (store (let ((.cse74 (let ((.cse77 (store |c_#memory_int| c_main_~a~0.base .cse29))) (store .cse77 |c_main_~#sum~0.base| (let ((.cse78 (select .cse77 |c_main_~#sum~0.base|))) (store .cse78 |c_main_~#sum~0.offset| (let ((.cse79 (select .cse29 c_main_~a~0.offset)) (.cse80 (select .cse78 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse77 |c_main_~#sum~0.base| (store .cse78 |c_main_~#sum~0.offset| (+ .cse79 .cse80))) c_main_~a~0.base) .cse7) .cse79 .cse80)))))))) (let ((.cse76 (store (store (select .cse74 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse71 (select (select (store .cse74 c_main_~a~0.base .cse76) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse72 (store .cse74 c_main_~a~0.base (let ((.cse75 (store .cse76 c_main_~a~0.offset .cse71))) (store .cse75 .cse7 (select (select (store .cse74 c_main_~a~0.base .cse75) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse73 (select .cse72 |c_main_~#sum~0.base|))) (let ((.cse69 (select .cse73 |c_main_~#sum~0.offset|))) (let ((.cse70 (select (select (store .cse72 |c_main_~#sum~0.base| (store .cse73 |c_main_~#sum~0.offset| (+ .cse69 .cse71))) c_main_~a~0.base) .cse7))) (let ((.cse68 (select (store .cse72 |c_main_~#sum~0.base| (store .cse73 |c_main_~#sum~0.offset| (+ .cse69 .cse70 .cse71))) c_main_~a~0.base))) (store .cse68 c_main_~a~0.offset (+ .cse69 .cse70 .cse71 (select .cse68 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1)))) (or .cse13 .cse14 .cse30 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse0 (select (store (let ((.cse87 (let ((.cse94 (store .cse9 .cse10 1))) (let ((.cse90 (store |c_#memory_int| c_main_~a~0.base .cse94))) (store .cse90 |c_main_~#sum~0.base| (let ((.cse91 (select .cse90 |c_main_~#sum~0.base|))) (store .cse91 |c_main_~#sum~0.offset| (let ((.cse92 (select .cse94 c_main_~a~0.offset)) (.cse93 (select .cse91 |c_main_~#sum~0.offset|))) (+ .cse92 .cse93 (select (select (store .cse90 |c_main_~#sum~0.base| (store .cse91 |c_main_~#sum~0.offset| (+ .cse92 .cse93))) c_main_~a~0.base) .cse7)))))))))) (let ((.cse89 (store (store (select .cse87 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse83 (select (select (store .cse87 c_main_~a~0.base .cse89) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse85 (store .cse87 c_main_~a~0.base (let ((.cse88 (store .cse89 c_main_~a~0.offset .cse83))) (store .cse88 .cse7 (select (select (store .cse87 c_main_~a~0.base .cse88) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse86 (select .cse85 |c_main_~#sum~0.base|))) (let ((.cse82 (select .cse86 |c_main_~#sum~0.offset|))) (let ((.cse84 (select (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse83))) c_main_~a~0.base) .cse7))) (let ((.cse81 (select (store .cse85 |c_main_~#sum~0.base| (store .cse86 |c_main_~#sum~0.offset| (+ .cse82 .cse83 .cse84))) c_main_~a~0.base))) (store .cse81 c_main_~a~0.offset (+ .cse82 .cse83 .cse84 (select .cse81 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse31) (or .cse14 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= (select (store (let ((.cse101 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse104 .cse105 (select .cse42 .cse10)))))) (let ((.cse103 (store (store (select .cse101 c_main_~a~0.base) c_main_~a~0.offset 0) .cse7 0))) (let ((.cse98 (select (select (store .cse101 c_main_~a~0.base .cse103) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse99 (store .cse101 c_main_~a~0.base (let ((.cse102 (store .cse103 c_main_~a~0.offset .cse98))) (store .cse102 .cse7 (select (select (store .cse101 c_main_~a~0.base .cse102) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse100 (select .cse99 |c_main_~#sum~0.base|))) (let ((.cse96 (select .cse100 |c_main_~#sum~0.offset|))) (let ((.cse97 (select (select (store .cse99 |c_main_~#sum~0.base| (store .cse100 |c_main_~#sum~0.offset| (+ .cse96 .cse98))) c_main_~a~0.base) .cse7))) (let ((.cse95 (select (store .cse99 |c_main_~#sum~0.base| (store .cse100 |c_main_~#sum~0.offset| (+ .cse96 .cse97 .cse98))) c_main_~a~0.base))) (store .cse95 c_main_~a~0.offset (+ .cse96 .cse97 (select .cse95 c_main_~a~0.offset) .cse98)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset) .cse0))) .cse31)))))))))) is different from true [2023-04-01 20:11:38,960 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse102 (* c_main_~i~0 8))) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse54 (+ c_main_~a~0.offset .cse102)) (.cse1 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse34 (select .cse1 |c_main_~#sum~0.offset|)) (.cse101 (select .cse0 .cse54))) (let ((.cse55 (+ .cse34 .cse101))) (let ((.cse43 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| .cse55))) (.cse103 (+ c_main_~i~0 1))) (let ((.cse36 (<= c_~N~0 c_main_~i~0)) (.cse35 (< .cse103 c_~N~0)) (.cse20 (store .cse0 .cse54 1)) (.cse2 (< 2 c_~N~0)) (.cse22 (<= c_~N~0 1)) (.cse3 (<= c_~N~0 .cse103)) (.cse11 (+ c_main_~a~0.offset 8)) (.cse46 (select .cse43 c_main_~a~0.base)) (.cse21 (+ c_main_~a~0.offset .cse102 8)) (.cse4 (+ (* c_~N~0 2) (* c_~N~0 c_~N~0))) (.cse23 (< (+ c_main_~i~0 2) c_~N~0))) (and (<= c_~N~0 2) (= (select .cse0 0) 2) (= 2 (select .cse1 0)) (or .cse2 .cse3 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse4 (select (store (let ((.cse12 (let ((.cse19 (store .cse20 .cse21 1))) (let ((.cse15 (store |c_#memory_int| c_main_~a~0.base .cse19))) (store .cse15 |c_main_~#sum~0.base| (let ((.cse16 (select .cse15 |c_main_~#sum~0.base|))) (store .cse16 |c_main_~#sum~0.offset| (let ((.cse17 (select .cse16 |c_main_~#sum~0.offset|)) (.cse18 (select .cse19 c_main_~a~0.offset))) (+ .cse17 .cse18 (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ .cse17 .cse18))) c_main_~a~0.base) .cse11)))))))))) (let ((.cse14 (store (store (select .cse12 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse6 (select (select (store .cse12 c_main_~a~0.base .cse14) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse9 (store .cse12 c_main_~a~0.base (let ((.cse13 (store .cse14 c_main_~a~0.offset .cse6))) (store .cse13 .cse11 (select (select (store .cse12 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse10 |c_main_~#sum~0.offset|))) (let ((.cse7 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse6 .cse8))) c_main_~a~0.base) .cse11))) (let ((.cse5 (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse6 .cse7 .cse8))) c_main_~a~0.base))) (store .cse5 c_main_~a~0.offset (+ .cse6 .cse7 .cse8 (select .cse5 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse22 .cse23) (or .cse2 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse4 (select (store (let ((.cse30 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (let ((.cse33 (select .cse0 c_main_~a~0.offset))) (+ .cse33 .cse34 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse33 .cse34))) c_main_~a~0.base) .cse11))))))) (let ((.cse32 (store (store (select .cse30 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse25 (select (select (store .cse30 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse28 (store .cse30 c_main_~a~0.base (let ((.cse31 (store .cse32 c_main_~a~0.offset .cse25))) (store .cse31 .cse11 (select (select (store .cse30 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse29 (select .cse28 |c_main_~#sum~0.base|))) (let ((.cse26 (select .cse29 |c_main_~#sum~0.offset|))) (let ((.cse27 (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ .cse25 .cse26))) c_main_~a~0.base) .cse11))) (let ((.cse24 (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ .cse25 .cse26 .cse27))) c_main_~a~0.base))) (store .cse24 c_main_~a~0.offset (+ .cse25 .cse26 (select .cse24 c_main_~a~0.offset) .cse27)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse22 .cse35) (= 2 (select .cse0 8)) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (< 1 c_~N~0) (or .cse36 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse4 (select (store (let ((.cse45 (store (store .cse46 c_main_~a~0.offset 0) .cse11 0))) (let ((.cse40 (select (select (store .cse43 c_main_~a~0.base .cse45) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse41 (store .cse43 c_main_~a~0.base (let ((.cse44 (store .cse45 c_main_~a~0.offset .cse40))) (store .cse44 .cse11 (select (select (store .cse43 c_main_~a~0.base .cse44) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse42 (select .cse41 |c_main_~#sum~0.base|))) (let ((.cse38 (select .cse42 |c_main_~#sum~0.offset|))) (let ((.cse39 (select (select (store .cse41 |c_main_~#sum~0.base| (store .cse42 |c_main_~#sum~0.offset| (+ .cse38 .cse40))) c_main_~a~0.base) .cse11))) (let ((.cse37 (select (store .cse41 |c_main_~#sum~0.base| (store .cse42 |c_main_~#sum~0.offset| (+ .cse38 .cse39 .cse40))) c_main_~a~0.base))) (store .cse37 c_main_~a~0.offset (+ .cse38 .cse39 (select .cse37 c_main_~a~0.offset) .cse40))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse35) (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse4 (select (store (let ((.cse53 (store .cse0 .cse54 .cse55))) (let ((.cse51 (store |c_#memory_int| c_main_~a~0.base .cse53))) (let ((.cse52 (select .cse51 |c_main_~#sum~0.base|))) (let ((.cse48 (select .cse53 c_main_~a~0.offset)) (.cse49 (select .cse52 |c_main_~#sum~0.offset|))) (let ((.cse50 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse49))) c_main_~a~0.base) .cse11))) (let ((.cse47 (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| (+ .cse48 .cse49 .cse50))) c_main_~a~0.base))) (store .cse47 c_main_~a~0.offset (+ .cse48 .cse49 .cse50 (select .cse47 c_main_~a~0.offset))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) (= |c_main_~#sum~0.offset| 0) (or (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse4 (select (store (let ((.cse62 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ (select .cse0 .cse21) .cse34))))) (let ((.cse64 (store (store (select .cse62 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse57 (select (select (store .cse62 c_main_~a~0.base .cse64) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse60 (store .cse62 c_main_~a~0.base (let ((.cse63 (store .cse64 c_main_~a~0.offset .cse57))) (store .cse63 .cse11 (select (select (store .cse62 c_main_~a~0.base .cse63) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse61 (select .cse60 |c_main_~#sum~0.base|))) (let ((.cse59 (select .cse61 |c_main_~#sum~0.offset|))) (let ((.cse58 (select (select (store .cse60 |c_main_~#sum~0.base| (store .cse61 |c_main_~#sum~0.offset| (+ .cse57 .cse59))) c_main_~a~0.base) .cse11))) (let ((.cse56 (select (store .cse60 |c_main_~#sum~0.base| (store .cse61 |c_main_~#sum~0.offset| (+ .cse57 .cse58 .cse59))) c_main_~a~0.base))) (store .cse56 c_main_~a~0.offset (+ .cse57 .cse58 .cse59 (select .cse56 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1))) .cse3 .cse23) (or .cse2 .cse22 .cse36 .cse35 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (= .cse4 (select (store (let ((.cse71 (let ((.cse74 (store |c_#memory_int| c_main_~a~0.base .cse20))) (store .cse74 |c_main_~#sum~0.base| (let ((.cse75 (select .cse74 |c_main_~#sum~0.base|))) (store .cse75 |c_main_~#sum~0.offset| (let ((.cse76 (select .cse20 c_main_~a~0.offset)) (.cse77 (select .cse75 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse74 |c_main_~#sum~0.base| (store .cse75 |c_main_~#sum~0.offset| (+ .cse76 .cse77))) c_main_~a~0.base) .cse11) .cse76 .cse77)))))))) (let ((.cse73 (store (store (select .cse71 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse68 (select (select (store .cse71 c_main_~a~0.base .cse73) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse69 (store .cse71 c_main_~a~0.base (let ((.cse72 (store .cse73 c_main_~a~0.offset .cse68))) (store .cse72 .cse11 (select (select (store .cse71 c_main_~a~0.base .cse72) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse70 (select .cse69 |c_main_~#sum~0.base|))) (let ((.cse66 (select .cse70 |c_main_~#sum~0.offset|))) (let ((.cse67 (select (select (store .cse69 |c_main_~#sum~0.base| (store .cse70 |c_main_~#sum~0.offset| (+ .cse66 .cse68))) c_main_~a~0.base) .cse11))) (let ((.cse65 (select (store .cse69 |c_main_~#sum~0.base| (store .cse70 |c_main_~#sum~0.offset| (+ .cse66 .cse67 .cse68))) c_main_~a~0.base))) (store .cse65 c_main_~a~0.offset (+ .cse66 .cse67 .cse68 (select .cse65 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)) (< v_main_~i~0_85 1)))) (or .cse2 .cse3 .cse22 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= .cse4 (select (store (let ((.cse84 (let ((.cse91 (store .cse0 .cse21 1))) (let ((.cse87 (store |c_#memory_int| c_main_~a~0.base .cse91))) (store .cse87 |c_main_~#sum~0.base| (let ((.cse88 (select .cse87 |c_main_~#sum~0.base|))) (store .cse88 |c_main_~#sum~0.offset| (let ((.cse89 (select .cse91 c_main_~a~0.offset)) (.cse90 (select .cse88 |c_main_~#sum~0.offset|))) (+ .cse89 .cse90 (select (select (store .cse87 |c_main_~#sum~0.base| (store .cse88 |c_main_~#sum~0.offset| (+ .cse89 .cse90))) c_main_~a~0.base) .cse11)))))))))) (let ((.cse86 (store (store (select .cse84 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse80 (select (select (store .cse84 c_main_~a~0.base .cse86) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse82 (store .cse84 c_main_~a~0.base (let ((.cse85 (store .cse86 c_main_~a~0.offset .cse80))) (store .cse85 .cse11 (select (select (store .cse84 c_main_~a~0.base .cse85) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse83 (select .cse82 |c_main_~#sum~0.base|))) (let ((.cse79 (select .cse83 |c_main_~#sum~0.offset|))) (let ((.cse81 (select (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse79 .cse80))) c_main_~a~0.base) .cse11))) (let ((.cse78 (select (store .cse82 |c_main_~#sum~0.base| (store .cse83 |c_main_~#sum~0.offset| (+ .cse79 .cse80 .cse81))) c_main_~a~0.base))) (store .cse78 c_main_~a~0.offset (+ .cse79 .cse80 .cse81 (select .cse78 c_main_~a~0.offset))))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset)))) .cse23) (or .cse3 (forall ((v_main_~i~0_85 Int) (v_ArrVal_259 Int)) (or (< v_main_~i~0_85 1) (= (select (store (let ((.cse98 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse34 .cse101 (select .cse46 .cse21)))))) (let ((.cse100 (store (store (select .cse98 c_main_~a~0.base) c_main_~a~0.offset 0) .cse11 0))) (let ((.cse95 (select (select (store .cse98 c_main_~a~0.base .cse100) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse96 (store .cse98 c_main_~a~0.base (let ((.cse99 (store .cse100 c_main_~a~0.offset .cse95))) (store .cse99 .cse11 (select (select (store .cse98 c_main_~a~0.base .cse99) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (let ((.cse97 (select .cse96 |c_main_~#sum~0.base|))) (let ((.cse93 (select .cse97 |c_main_~#sum~0.offset|))) (let ((.cse94 (select (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse93 .cse95))) c_main_~a~0.base) .cse11))) (let ((.cse92 (select (store .cse96 |c_main_~#sum~0.base| (store .cse97 |c_main_~#sum~0.offset| (+ .cse93 .cse94 .cse95))) c_main_~a~0.base))) (store .cse92 c_main_~a~0.offset (+ .cse93 .cse94 (select .cse92 c_main_~a~0.offset) .cse95)))))))))) (+ c_main_~a~0.offset (* v_main_~i~0_85 8)) v_ArrVal_259) c_main_~a~0.offset) .cse4))) .cse23)))))))) is different from true