/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/s22if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 20:00:18,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 20:00:18,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 20:00:18,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 20:00:18,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 20:00:18,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 20:00:18,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 20:00:18,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 20:00:18,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 20:00:18,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 20:00:18,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 20:00:18,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 20:00:18,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 20:00:18,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 20:00:18,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 20:00:18,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 20:00:18,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 20:00:18,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 20:00:18,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 20:00:18,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 20:00:18,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 20:00:18,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 20:00:18,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 20:00:18,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 20:00:18,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 20:00:18,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 20:00:18,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 20:00:18,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 20:00:18,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 20:00:18,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 20:00:18,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 20:00:18,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 20:00:18,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 20:00:18,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 20:00:18,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 20:00:18,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 20:00:18,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 20:00:18,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 20:00:18,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 20:00:18,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 20:00:18,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 20:00:18,272 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:00:18,301 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 20:00:18,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 20:00:18,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 20:00:18,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 20:00:18,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 20:00:18,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 20:00:18,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 20:00:18,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 20:00:18,304 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 20:00:18,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 20:00:18,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 20:00:18,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 20:00:18,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:00:18,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 20:00:18,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 20:00:18,308 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 20:00:18,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 20:00:18,308 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 20:00:18,308 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:00:18,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 20:00:18,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 20:00:18,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 20:00:18,564 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 20:00:18,564 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 20:00:18,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s22if.c [2023-04-01 20:00:19,734 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 20:00:19,915 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 20:00:19,916 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22if.c [2023-04-01 20:00:19,920 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9edb573/673d0f1210484a0bb39992d27e623ffd/FLAG0b32ec11e [2023-04-01 20:00:19,930 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9edb573/673d0f1210484a0bb39992d27e623ffd [2023-04-01 20:00:19,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 20:00:19,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 20:00:19,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 20:00:19,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 20:00:19,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 20:00:19,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:00:19" (1/1) ... [2023-04-01 20:00:19,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4f202d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:19, skipping insertion in model container [2023-04-01 20:00:19,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:00:19" (1/1) ... [2023-04-01 20:00:19,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 20:00:19,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 20:00:20,081 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/s22if.c[588,601] [2023-04-01 20:00:20,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:00:20,103 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 20:00:20,112 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/s22if.c[588,601] [2023-04-01 20:00:20,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 20:00:20,130 INFO L208 MainTranslator]: Completed translation [2023-04-01 20:00:20,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20 WrapperNode [2023-04-01 20:00:20,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 20:00:20,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 20:00:20,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 20:00:20,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 20:00:20,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,156 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 20:00:20,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 20:00:20,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 20:00:20,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 20:00:20,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (1/1) ... [2023-04-01 20:00:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 20:00:20,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:20,190 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:00:20,194 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:00:20,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 20:00:20,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 20:00:20,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 20:00:20,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 20:00:20,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 20:00:20,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 20:00:20,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 20:00:20,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 20:00:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 20:00:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 20:00:20,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 20:00:20,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 20:00:20,289 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 20:00:20,290 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 20:00:20,520 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 20:00:20,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 20:00:20,525 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 20:00:20,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:00:20 BoogieIcfgContainer [2023-04-01 20:00:20,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 20:00:20,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 20:00:20,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 20:00:20,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 20:00:20,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 08:00:19" (1/3) ... [2023-04-01 20:00:20,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:00:20, skipping insertion in model container [2023-04-01 20:00:20,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:00:20" (2/3) ... [2023-04-01 20:00:20,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9fd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:00:20, skipping insertion in model container [2023-04-01 20:00:20,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:00:20" (3/3) ... [2023-04-01 20:00:20,533 INFO L112 eAbstractionObserver]: Analyzing ICFG s22if.c [2023-04-01 20:00:20,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 20:00:20,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 20:00:20,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 20:00:20,591 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;@3944113e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 20:00:20,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 20:00:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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:00:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 20:00:20,602 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:20,603 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] [2023-04-01 20:00:20,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:20,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1742232210, now seen corresponding path program 1 times [2023-04-01 20:00:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:20,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241736763] [2023-04-01 20:00:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:20,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:20,865 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:00:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241736763] [2023-04-01 20:00:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241736763] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:00:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:00:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 20:00:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885586037] [2023-04-01 20:00:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:00:20,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 20:00:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 20:00:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 20:00:20,922 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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:00:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:21,007 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2023-04-01 20:00:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 20:00:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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 23 [2023-04-01 20:00:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:21,014 INFO L225 Difference]: With dead ends: 62 [2023-04-01 20:00:21,014 INFO L226 Difference]: Without dead ends: 29 [2023-04-01 20:00:21,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 20:00:21,020 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:21,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-01 20:00:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-04-01 20:00:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 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:00:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-01 20:00:21,050 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2023-04-01 20:00:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:21,050 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-01 20:00:21,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (4), 3 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:00:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-01 20:00:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 20:00:21,052 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:21,052 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] [2023-04-01 20:00:21,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 20:00:21,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:21,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 416194299, now seen corresponding path program 1 times [2023-04-01 20:00:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388490218] [2023-04-01 20:00:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:21,232 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:00:21,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:21,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388490218] [2023-04-01 20:00:21,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388490218] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 20:00:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 20:00:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 20:00:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912506305] [2023-04-01 20:00:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 20:00:21,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 20:00:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 20:00:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 20:00:21,237 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:00:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:21,327 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-04-01 20:00:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 20:00:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-04-01 20:00:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:21,328 INFO L225 Difference]: With dead ends: 51 [2023-04-01 20:00:21,329 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 20:00:21,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-04-01 20:00:21,330 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:21,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 22 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 20:00:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-04-01 20:00:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 4 states have call successors, (4), 4 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:00:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-04-01 20:00:21,339 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2023-04-01 20:00:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:21,340 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-04-01 20:00:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 20:00:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-04-01 20:00:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 20:00:21,341 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:21,341 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] [2023-04-01 20:00:21,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 20:00:21,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:21,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:21,342 INFO L85 PathProgramCache]: Analyzing trace with hash -708797194, now seen corresponding path program 1 times [2023-04-01 20:00:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458388024] [2023-04-01 20:00:21,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:21,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458388024] [2023-04-01 20:00:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458388024] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980995137] [2023-04-01 20:00:22,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:22,127 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:00:22,129 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:00:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:22,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2023-04-01 20:00:22,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:22,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:22,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:22,463 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 14 treesize of output 16 [2023-04-01 20:00:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:22,571 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 14 treesize of output 16 [2023-04-01 20:00:22,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:22,656 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 30 treesize of output 25 [2023-04-01 20:00:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:22,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:22,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_44 (Array Int Int)) (main_~a~0.offset Int)) (or (= (+ 3 (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_44) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (* c_~N~0 3)) (not (= (select v_ArrVal_44 (+ main_~a~0.offset (* main_~i~0 4))) 3)))) is different from false [2023-04-01 20:00:23,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:23,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-04-01 20:00:23,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 20:00:23,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-04-01 20:00:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-04-01 20:00:23,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980995137] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:23,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 32 [2023-04-01 20:00:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186503979] [2023-04-01 20:00:23,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:23,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 20:00:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 20:00:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=759, Unknown=2, NotChecked=58, Total=992 [2023-04-01 20:00:23,252 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 32 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 20:00:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:24,038 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2023-04-01 20:00:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-01 20:00:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-04-01 20:00:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:24,041 INFO L225 Difference]: With dead ends: 57 [2023-04-01 20:00:24,041 INFO L226 Difference]: Without dead ends: 51 [2023-04-01 20:00:24,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1548, Unknown=2, NotChecked=84, Total=1980 [2023-04-01 20:00:24,043 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:24,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 90 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 532 Invalid, 4 Unknown, 59 Unchecked, 0.4s Time] [2023-04-01 20:00:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-01 20:00:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-04-01 20:00:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 4 states have call successors, (4), 4 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:00:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-04-01 20:00:24,059 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2023-04-01 20:00:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:24,060 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-04-01 20:00:24,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 20:00:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-04-01 20:00:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 20:00:24,061 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:24,061 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] [2023-04-01 20:00:24,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-01 20:00:24,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:24,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:24,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1518143820, now seen corresponding path program 1 times [2023-04-01 20:00:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97535448] [2023-04-01 20:00:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:24,298 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009241724] [2023-04-01 20:00:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:24,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:24,300 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:00:24,327 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:00:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:24,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2023-04-01 20:00:24,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:24,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-04-01 20:00:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:24,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:24,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-04-01 20:00:24,500 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:24,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2023-04-01 20:00:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97535448] [2023-04-01 20:00:24,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009241724] [2023-04-01 20:00:24,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009241724] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:24,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:24,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-04-01 20:00:24,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565557708] [2023-04-01 20:00:24,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:24,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:00:24,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:24,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:00:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:00:24,521 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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:00:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:24,644 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2023-04-01 20:00:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 20:00:24,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 31 [2023-04-01 20:00:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:24,649 INFO L225 Difference]: With dead ends: 87 [2023-04-01 20:00:24,649 INFO L226 Difference]: Without dead ends: 73 [2023-04-01 20:00:24,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:00:24,654 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:24,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-04-01 20:00:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2023-04-01 20:00:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 4 states have call successors, (4), 4 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:00:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-04-01 20:00:24,673 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 31 [2023-04-01 20:00:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:24,673 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-04-01 20:00:24,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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:00:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-04-01 20:00:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 20:00:24,677 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:24,677 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] [2023-04-01 20:00:24,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:24,882 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,SelfDestructingSolverStorable3 [2023-04-01 20:00:24,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:24,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2104949834, now seen corresponding path program 1 times [2023-04-01 20:00:24,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:24,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891574310] [2023-04-01 20:00:24,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:24,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:24,893 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50191143] [2023-04-01 20:00:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:24,895 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:00:24,898 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:00:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:24,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-01 20:00:24,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:24,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:25,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:25,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-04-01 20:00:25,022 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 14 treesize of output 12 [2023-04-01 20:00:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891574310] [2023-04-01 20:00:25,034 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:25,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50191143] [2023-04-01 20:00:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50191143] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:25,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-04-01 20:00:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703087921] [2023-04-01 20:00:25,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:25,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 20:00:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:25,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 20:00:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 20:00:25,036 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:00:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:25,108 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-04-01 20:00:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 20:00:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2023-04-01 20:00:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:25,109 INFO L225 Difference]: With dead ends: 90 [2023-04-01 20:00:25,109 INFO L226 Difference]: Without dead ends: 67 [2023-04-01 20:00:25,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-04-01 20:00:25,110 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:25,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 20:00:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-04-01 20:00:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-04-01 20:00:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (4), 4 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:00:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2023-04-01 20:00:25,128 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 31 [2023-04-01 20:00:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:25,128 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2023-04-01 20:00:25,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:00:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2023-04-01 20:00:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-04-01 20:00:25,129 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:25,129 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] [2023-04-01 20:00:25,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 20:00:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:25,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:25,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1233490552, now seen corresponding path program 2 times [2023-04-01 20:00:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301840954] [2023-04-01 20:00:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301840954] [2023-04-01 20:00:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301840954] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622603379] [2023-04-01 20:00:25,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:00:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:25,437 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:00:25,461 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:00:25,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:00:25,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:25,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 20:00:25,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:25,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622603379] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:25,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 20:00:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539126881] [2023-04-01 20:00:25,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:25,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:00:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:00:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:00:25,604 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:25,823 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2023-04-01 20:00:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 20:00:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-04-01 20:00:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:25,824 INFO L225 Difference]: With dead ends: 97 [2023-04-01 20:00:25,824 INFO L226 Difference]: Without dead ends: 85 [2023-04-01 20:00:25,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-04-01 20:00:25,825 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:25,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:00:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-04-01 20:00:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-04-01 20:00:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 4 states have call successors, (4), 4 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:00:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-04-01 20:00:25,836 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 33 [2023-04-01 20:00:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:25,837 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-04-01 20:00:25,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-04-01 20:00:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-04-01 20:00:25,838 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:25,838 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 20:00:25,851 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:00:26,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:26,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:26,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash -41402357, now seen corresponding path program 3 times [2023-04-01 20:00:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:26,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511004719] [2023-04-01 20:00:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:26,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:26,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:26,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:26,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511004719] [2023-04-01 20:00:26,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511004719] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:26,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065215598] [2023-04-01 20:00:26,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:00:26,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:26,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:26,193 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:00:26,217 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:00:26,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 20:00:26,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:26,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 20:00:26,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:26,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 20:00:26,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065215598] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:26,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:26,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 20:00:26,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207359689] [2023-04-01 20:00:26,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:26,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 20:00:26,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:26,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 20:00:26,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 20:00:26,365 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:26,537 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2023-04-01 20:00:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 20:00:26,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-04-01 20:00:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:26,538 INFO L225 Difference]: With dead ends: 90 [2023-04-01 20:00:26,538 INFO L226 Difference]: Without dead ends: 52 [2023-04-01 20:00:26,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:00:26,539 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:26,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 57 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-04-01 20:00:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2023-04-01 20:00:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 4 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:00:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-04-01 20:00:26,546 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2023-04-01 20:00:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:26,547 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-04-01 20:00:26,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-04-01 20:00:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 20:00:26,561 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:26,561 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 20:00:26,574 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:00:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:26,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:26,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 854203999, now seen corresponding path program 4 times [2023-04-01 20:00:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128825006] [2023-04-01 20:00:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 20:00:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:27,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128825006] [2023-04-01 20:00:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128825006] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284885858] [2023-04-01 20:00:27,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:00:27,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:27,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:27,535 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:00:27,564 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:00:27,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:00:27,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:27,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 45 conjunts are in the unsatisfiable core [2023-04-01 20:00:27,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:27,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:27,636 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:00:27,646 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 14 treesize of output 16 [2023-04-01 20:00:27,677 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 14 treesize of output 16 [2023-04-01 20:00:27,757 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 14 treesize of output 16 [2023-04-01 20:00:27,780 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 14 treesize of output 16 [2023-04-01 20:00:27,847 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 30 treesize of output 25 [2023-04-01 20:00:27,941 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:27,941 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:28,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:28,421 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_208 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_61 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_208 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (= (* c_~N~0 3) (+ 6 .cse0)) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 3 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 3))))))) is different from false [2023-04-01 20:00:28,719 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_208 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (or (< .cse0 (+ 4 .cse1)) (not (= 3 (select v_ArrVal_208 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 3))))))) (forall ((v_ArrVal_208 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= 3 (select v_ArrVal_208 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< (+ 2 .cse4) .cse0) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 3))))))))) is different from false [2023-04-01 20:00:28,751 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_208 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (or (< .cse0 (+ .cse1 1)) (not (= 3 (select v_ArrVal_208 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 3 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 3))))))) (forall ((v_ArrVal_208 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_208))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= 3 (select v_ArrVal_208 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< .cse4 (+ .cse0 1)) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 3 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 3))))))))) is different from false [2023-04-01 20:00:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2023-04-01 20:00:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284885858] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:28,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2023-04-01 20:00:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371289504] [2023-04-01 20:00:28,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:28,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-04-01 20:00:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-04-01 20:00:28,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1069, Unknown=4, NotChecked=204, Total=1406 [2023-04-01 20:00:28,807 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:32,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:32,589 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2023-04-01 20:00:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-04-01 20:00:32,590 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-04-01 20:00:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:32,591 INFO L225 Difference]: With dead ends: 103 [2023-04-01 20:00:32,591 INFO L226 Difference]: Without dead ends: 97 [2023-04-01 20:00:32,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=400, Invalid=2798, Unknown=6, NotChecked=336, Total=3540 [2023-04-01 20:00:32,593 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 66 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:32,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 175 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1058 Invalid, 13 Unknown, 243 Unchecked, 0.8s Time] [2023-04-01 20:00:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-01 20:00:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2023-04-01 20:00:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 4 states have call successors, (4), 4 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:00:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2023-04-01 20:00:32,606 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 39 [2023-04-01 20:00:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:32,607 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2023-04-01 20:00:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2023-04-01 20:00:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 20:00:32,608 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:32,608 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 20:00:32,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:32,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:32,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:32,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash 44857373, now seen corresponding path program 1 times [2023-04-01 20:00:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906254491] [2023-04-01 20:00:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:32,831 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:32,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099491334] [2023-04-01 20:00:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:32,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:32,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:32,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 20:00:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:32,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-01 20:00:32,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:32,917 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:00:33,016 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 11 [2023-04-01 20:00:33,073 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 14 treesize of output 16 [2023-04-01 20:00:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 20:00:33,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:33,163 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_255 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_255) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2023-04-01 20:00:33,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:33,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2023-04-01 20:00:33,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:33,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-04-01 20:00:33,211 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 7 treesize of output 3 [2023-04-01 20:00:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2023-04-01 20:00:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906254491] [2023-04-01 20:00:33,272 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099491334] [2023-04-01 20:00:33,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099491334] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:33,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:33,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-04-01 20:00:33,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529924160] [2023-04-01 20:00:33,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 20:00:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 20:00:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=4, NotChecked=32, Total=342 [2023-04-01 20:00:33,274 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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:00:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:33,637 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2023-04-01 20:00:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 20:00:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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 39 [2023-04-01 20:00:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:33,639 INFO L225 Difference]: With dead ends: 118 [2023-04-01 20:00:33,639 INFO L226 Difference]: Without dead ends: 109 [2023-04-01 20:00:33,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=4, NotChecked=42, Total=552 [2023-04-01 20:00:33,640 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 25 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:33,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 331 Invalid, 5 Unknown, 59 Unchecked, 0.2s Time] [2023-04-01 20:00:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-04-01 20:00:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2023-04-01 20:00:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 4 states have call successors, (4), 4 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:00:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-04-01 20:00:33,655 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 39 [2023-04-01 20:00:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:33,656 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-04-01 20:00:33,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 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:00:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-04-01 20:00:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 20:00:33,657 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:33,657 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 20:00:33,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:33,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:33,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:33,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -976210981, now seen corresponding path program 1 times [2023-04-01 20:00:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343666979] [2023-04-01 20:00:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:33,887 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409471454] [2023-04-01 20:00:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:33,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:33,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:33,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 20:00:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:33,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2023-04-01 20:00:33,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:33,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:34,029 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:00:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:34,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:34,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-04-01 20:00:34,104 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 16 treesize of output 12 [2023-04-01 20:00:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:34,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:34,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343666979] [2023-04-01 20:00:34,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:34,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409471454] [2023-04-01 20:00:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409471454] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:34,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-04-01 20:00:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479675628] [2023-04-01 20:00:34,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 20:00:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 20:00:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-04-01 20:00:34,130 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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:00:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:34,253 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-04-01 20:00:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 20:00:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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 39 [2023-04-01 20:00:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:34,255 INFO L225 Difference]: With dead ends: 127 [2023-04-01 20:00:34,255 INFO L226 Difference]: Without dead ends: 94 [2023-04-01 20:00:34,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-04-01 20:00:34,256 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:34,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-01 20:00:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-04-01 20:00:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 4 states have call successors, (4), 4 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:00:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2023-04-01 20:00:34,270 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 39 [2023-04-01 20:00:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:34,270 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2023-04-01 20:00:34,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 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:00:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2023-04-01 20:00:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 20:00:34,271 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:34,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-04-01 20:00:34,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:34,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 20:00:34,477 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:34,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1806332385, now seen corresponding path program 5 times [2023-04-01 20:00:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050844041] [2023-04-01 20:00:34,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:34,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050844041] [2023-04-01 20:00:34,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050844041] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284550337] [2023-04-01 20:00:34,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:00:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:34,621 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:34,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 20:00:34,716 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-04-01 20:00:34,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:34,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 20:00:34,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:34,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284550337] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:34,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-04-01 20:00:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131343123] [2023-04-01 20:00:34,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:34,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 20:00:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:34,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 20:00:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:00:34,878 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:35,155 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2023-04-01 20:00:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 20:00:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-04-01 20:00:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:35,156 INFO L225 Difference]: With dead ends: 133 [2023-04-01 20:00:35,156 INFO L226 Difference]: Without dead ends: 118 [2023-04-01 20:00:35,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-04-01 20:00:35,157 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:35,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 61 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:00:35,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-04-01 20:00:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2023-04-01 20:00:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 4 states have call successors, (4), 4 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:00:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2023-04-01 20:00:35,170 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 41 [2023-04-01 20:00:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:35,170 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2023-04-01 20:00:35,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2023-04-01 20:00:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-04-01 20:00:35,171 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:35,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-04-01 20:00:35,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:35,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:35,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:35,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1586682370, now seen corresponding path program 6 times [2023-04-01 20:00:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:35,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444356717] [2023-04-01 20:00:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 20:00:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444356717] [2023-04-01 20:00:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444356717] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746622404] [2023-04-01 20:00:35,486 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:00:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:35,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:35,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 20:00:35,562 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-04-01 20:00:35,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:35,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 20:00:35,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 20:00:35,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 20:00:35,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746622404] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:35,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-04-01 20:00:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476141413] [2023-04-01 20:00:35,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:35,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 20:00:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 20:00:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-04-01 20:00:35,692 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:35,847 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2023-04-01 20:00:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 20:00:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2023-04-01 20:00:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:35,848 INFO L225 Difference]: With dead ends: 121 [2023-04-01 20:00:35,848 INFO L226 Difference]: Without dead ends: 63 [2023-04-01 20:00:35,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-04-01 20:00:35,849 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:35,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 37 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-01 20:00:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2023-04-01 20:00:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 4 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:00:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-04-01 20:00:35,866 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2023-04-01 20:00:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:35,866 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-04-01 20:00:35,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-04-01 20:00:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 20:00:35,867 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:35,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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:00:35,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:36,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 20:00:36,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:36,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1783122278, now seen corresponding path program 7 times [2023-04-01 20:00:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405108495] [2023-04-01 20:00:36,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:36,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405108495] [2023-04-01 20:00:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405108495] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513866499] [2023-04-01 20:00:36,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 20:00:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:36,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:36,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:36,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 20:00:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:37,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjunts are in the unsatisfiable core [2023-04-01 20:00:37,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:37,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,177 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 14 treesize of output 16 [2023-04-01 20:00:37,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,235 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 14 treesize of output 16 [2023-04-01 20:00:37,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,294 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 14 treesize of output 16 [2023-04-01 20:00:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,454 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 14 treesize of output 16 [2023-04-01 20:00:37,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,480 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 14 treesize of output 16 [2023-04-01 20:00:37,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,512 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 14 treesize of output 16 [2023-04-01 20:00:37,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,590 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 30 treesize of output 25 [2023-04-01 20:00:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,724 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:37,725 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:37,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:37,882 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:37,882 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:38,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:38,704 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_124 Int) (main_~i~0 Int) (v_ArrVal_439 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_439))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 3 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))))) (= (+ 9 .cse2) (* c_~N~0 3)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124))) 3)) (not (= 3 (select v_ArrVal_439 (+ main_~a~0.offset (* main_~i~0 4)))))))))) is different from false [2023-04-01 20:00:39,502 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:39,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 1 [2023-04-01 20:00:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2023-04-01 20:00:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513866499] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:39,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 51 [2023-04-01 20:00:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577658366] [2023-04-01 20:00:39,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-04-01 20:00:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-04-01 20:00:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2258, Unknown=2, NotChecked=96, Total=2550 [2023-04-01 20:00:39,524 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 51 states, 49 states have (on average 1.836734693877551) internal successors, (90), 47 states have internal predecessors, (90), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:00:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:44,549 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2023-04-01 20:00:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-04-01 20:00:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.836734693877551) internal successors, (90), 47 states have internal predecessors, (90), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-04-01 20:00:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:44,551 INFO L225 Difference]: With dead ends: 129 [2023-04-01 20:00:44,551 INFO L226 Difference]: Without dead ends: 123 [2023-04-01 20:00:44,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2007 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=808, Invalid=7381, Unknown=5, NotChecked=178, Total=8372 [2023-04-01 20:00:44,553 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 97 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 176 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:44,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 183 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2127 Invalid, 43 Unknown, 95 Unchecked, 2.0s Time] [2023-04-01 20:00:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-04-01 20:00:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2023-04-01 20:00:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 4 states have call successors, (4), 4 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:00:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2023-04-01 20:00:44,574 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 47 [2023-04-01 20:00:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:44,574 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2023-04-01 20:00:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.836734693877551) internal successors, (90), 47 states have internal predecessors, (90), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:00:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2023-04-01 20:00:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 20:00:44,575 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:44,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-04-01 20:00:44,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:44,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 20:00:44,781 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:44,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1702498392, now seen corresponding path program 2 times [2023-04-01 20:00:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357198282] [2023-04-01 20:00:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:44,807 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441847937] [2023-04-01 20:00:44,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:00:44,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:44,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:44,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:44,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 20:00:44,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:00:44,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:44,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjunts are in the unsatisfiable core [2023-04-01 20:00:44,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:44,910 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:00:44,998 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 11 [2023-04-01 20:00:45,049 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 14 treesize of output 16 [2023-04-01 20:00:45,087 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 14 treesize of output 16 [2023-04-01 20:00:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-04-01 20:00:45,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:45,168 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_501) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 3)) is different from false [2023-04-01 20:00:45,180 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_501) c_main_~a~0.base) (+ c_main_~a~0.offset 8)))) is different from false [2023-04-01 20:00:45,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:45,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2023-04-01 20:00:45,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:45,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-04-01 20:00:45,228 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 7 treesize of output 3 [2023-04-01 20:00:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2023-04-01 20:00:45,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357198282] [2023-04-01 20:00:45,304 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:45,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441847937] [2023-04-01 20:00:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441847937] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:45,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-04-01 20:00:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015259068] [2023-04-01 20:00:45,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:45,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 20:00:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 20:00:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=343, Unknown=3, NotChecked=78, Total=506 [2023-04-01 20:00:45,306 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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:00:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:45,775 INFO L93 Difference]: Finished difference Result 148 states and 183 transitions. [2023-04-01 20:00:45,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:00:45,775 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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 47 [2023-04-01 20:00:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:45,776 INFO L225 Difference]: With dead ends: 148 [2023-04-01 20:00:45,776 INFO L226 Difference]: Without dead ends: 139 [2023-04-01 20:00:45,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=525, Unknown=3, NotChecked=98, Total=756 [2023-04-01 20:00:45,777 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:45,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 322 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 555 Invalid, 6 Unknown, 144 Unchecked, 0.3s Time] [2023-04-01 20:00:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-04-01 20:00:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2023-04-01 20:00:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 4 states have call successors, (4), 4 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:00:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2023-04-01 20:00:45,802 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 47 [2023-04-01 20:00:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:45,803 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2023-04-01 20:00:45,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 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:00:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2023-04-01 20:00:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-04-01 20:00:45,804 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:45,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-04-01 20:00:45,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:46,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 20:00:46,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:46,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash 13554650, now seen corresponding path program 2 times [2023-04-01 20:00:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298825808] [2023-04-01 20:00:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:46,027 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645445389] [2023-04-01 20:00:46,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:00:46,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:46,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:46,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:46,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 20:00:46,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:00:46,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:46,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 20:00:46,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:46,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:46,178 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:00:46,199 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:00:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:46,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:46,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-04-01 20:00:46,288 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 16 treesize of output 12 [2023-04-01 20:00:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:46,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298825808] [2023-04-01 20:00:46,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:46,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645445389] [2023-04-01 20:00:46,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645445389] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:46,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:46,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-04-01 20:00:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554963298] [2023-04-01 20:00:46,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:46,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 20:00:46,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 20:00:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-04-01 20:00:46,326 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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:00:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:46,515 INFO L93 Difference]: Finished difference Result 171 states and 215 transitions. [2023-04-01 20:00:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 20:00:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 47 [2023-04-01 20:00:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:46,516 INFO L225 Difference]: With dead ends: 171 [2023-04-01 20:00:46,516 INFO L226 Difference]: Without dead ends: 124 [2023-04-01 20:00:46,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:00:46,517 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:46,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-04-01 20:00:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2023-04-01 20:00:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 4 states have call successors, (4), 4 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:00:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2023-04-01 20:00:46,538 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 47 [2023-04-01 20:00:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:46,539 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2023-04-01 20:00:46,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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:00:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2023-04-01 20:00:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 20:00:46,539 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:46,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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:00:46,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:46,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 20:00:46,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:46,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1992988644, now seen corresponding path program 8 times [2023-04-01 20:00:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48683897] [2023-04-01 20:00:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48683897] [2023-04-01 20:00:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48683897] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665722452] [2023-04-01 20:00:46,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:00:46,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:46,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:46,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:46,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 20:00:46,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:00:46,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:46,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 20:00:46,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:47,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:47,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665722452] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:47,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:47,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-04-01 20:00:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398558826] [2023-04-01 20:00:47,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:47,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 20:00:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 20:00:47,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-04-01 20:00:47,163 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:47,559 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2023-04-01 20:00:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 20:00:47,560 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2023-04-01 20:00:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:47,560 INFO L225 Difference]: With dead ends: 172 [2023-04-01 20:00:47,561 INFO L226 Difference]: Without dead ends: 154 [2023-04-01 20:00:47,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:00:47,561 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 104 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:47,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 53 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:00:47,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-04-01 20:00:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2023-04-01 20:00:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 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:00:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2023-04-01 20:00:47,584 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 49 [2023-04-01 20:00:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:47,584 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2023-04-01 20:00:47,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2023-04-01 20:00:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-01 20:00:47,585 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:47,585 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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:00:47,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:47,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:47,790 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:47,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 836309991, now seen corresponding path program 9 times [2023-04-01 20:00:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827719136] [2023-04-01 20:00:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:47,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:47,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827719136] [2023-04-01 20:00:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827719136] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614874699] [2023-04-01 20:00:47,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:00:47,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:47,949 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 20:00:47,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 20:00:48,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 20:00:48,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:48,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 20:00:48,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:48,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 20:00:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614874699] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:48,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:48,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-04-01 20:00:48,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483011615] [2023-04-01 20:00:48,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:48,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 20:00:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:48,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 20:00:48,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-04-01 20:00:48,275 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:48,470 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2023-04-01 20:00:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:00:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2023-04-01 20:00:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:48,471 INFO L225 Difference]: With dead ends: 155 [2023-04-01 20:00:48,471 INFO L226 Difference]: Without dead ends: 74 [2023-04-01 20:00:48,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-04-01 20:00:48,473 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 81 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:48,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 50 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 20:00:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-04-01 20:00:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2023-04-01 20:00:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 4 states have call successors, (4), 4 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:00:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-04-01 20:00:48,488 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 50 [2023-04-01 20:00:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:48,488 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-04-01 20:00:48,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-04-01 20:00:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 20:00:48,489 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:48,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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:00:48,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:48,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-04-01 20:00:48,694 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:48,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:48,695 INFO L85 PathProgramCache]: Analyzing trace with hash -217929789, now seen corresponding path program 10 times [2023-04-01 20:00:48,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:48,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862461012] [2023-04-01 20:00:48,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:48,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:00:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:00:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:00:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 20:00:50,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862461012] [2023-04-01 20:00:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862461012] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:00:50,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572837773] [2023-04-01 20:00:50,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:00:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:50,035 INFO L229 MonitoredProcess]: Starting monitored process 17 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:00:50,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-04-01 20:00:50,143 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:00:50,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:50,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjunts are in the unsatisfiable core [2023-04-01 20:00:50,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:50,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:00:50,158 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:00:50,167 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 14 treesize of output 16 [2023-04-01 20:00:50,207 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 14 treesize of output 16 [2023-04-01 20:00:50,246 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 14 treesize of output 16 [2023-04-01 20:00:50,285 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 14 treesize of output 16 [2023-04-01 20:00:50,386 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 14 treesize of output 16 [2023-04-01 20:00:50,402 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 14 treesize of output 16 [2023-04-01 20:00:50,417 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 14 treesize of output 16 [2023-04-01 20:00:50,436 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 14 treesize of output 16 [2023-04-01 20:00:50,509 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 30 treesize of output 25 [2023-04-01 20:00:50,619 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:50,620 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:50,737 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:50,737 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:50,845 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:00:50,845 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:00:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:00:50,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:51,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 9 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (= (+ 12 .cse2) (* c_~N~0 3))))))) is different from false [2023-04-01 20:00:52,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 8 .cse0) .cse1) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 6 .cse0))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3))))))) (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3)) (< .cse1 (+ .cse6 10))))))))) is different from false [2023-04-01 20:00:52,251 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< .cse3 (+ 7 .cse2)) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 9 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3))))))) (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3)) (< (+ 5 .cse6) .cse3)))))))) is different from false [2023-04-01 20:00:52,329 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (or (< .cse0 (+ .cse1 4)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 6 .cse1))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3))))))) (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ 2 .cse6) .cse0) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3))))))))) is different from false [2023-04-01 20:00:52,420 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 3))) (and (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 9 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3)) (< .cse3 (+ .cse2 1))))))) (forall ((v_ArrVal_739 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_227 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_739))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse6 |c_main_~#sum~0.offset|))) (or (< .cse4 (+ .cse3 1)) (not (= 3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 6 .cse4))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 9 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))) 3)) (not (= (select v_ArrVal_739 (+ main_~a~0.offset (* 4 v_main_~i~0_227))) 3))))))))) is different from false [2023-04-01 20:00:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2023-04-01 20:00:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572837773] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:52,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:00:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 21] total 58 [2023-04-01 20:00:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770807279] [2023-04-01 20:00:52,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-04-01 20:00:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-04-01 20:00:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2571, Unknown=5, NotChecked=530, Total=3306 [2023-04-01 20:00:52,496 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 58 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 55 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:56,572 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2023-04-01 20:00:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-04-01 20:00:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 55 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-04-01 20:00:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:56,573 INFO L225 Difference]: With dead ends: 168 [2023-04-01 20:00:56,573 INFO L226 Difference]: Without dead ends: 162 [2023-04-01 20:00:56,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 88 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1983 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=678, Invalid=6992, Unknown=6, NotChecked=880, Total=8556 [2023-04-01 20:00:56,575 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 3032 mSolverCounterSat, 113 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3032 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:56,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 310 Invalid, 3735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3032 Invalid, 18 Unknown, 572 Unchecked, 1.9s Time] [2023-04-01 20:00:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-04-01 20:00:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2023-04-01 20:00:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 127 states have internal predecessors, (156), 4 states have call successors, (4), 4 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:00:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2023-04-01 20:00:56,600 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 55 [2023-04-01 20:00:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:56,601 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2023-04-01 20:00:56,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 55 states have internal predecessors, (101), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:00:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2023-04-01 20:00:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 20:00:56,601 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:56,601 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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:00:56,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:56,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-04-01 20:00:56,802 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:56,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1027276415, now seen corresponding path program 3 times [2023-04-01 20:00:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228411249] [2023-04-01 20:00:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:56,818 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50052234] [2023-04-01 20:00:56,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:00:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:56,819 INFO L229 MonitoredProcess]: Starting monitored process 18 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:00:56,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-04-01 20:00:56,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 20:00:56,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:56,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 20:00:56,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:57,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-04-01 20:00:57,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:57,089 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 18 treesize of output 20 [2023-04-01 20:00:57,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:57,114 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 18 treesize of output 20 [2023-04-01 20:00:57,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:57,149 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 18 treesize of output 20 [2023-04-01 20:00:57,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:57,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2023-04-01 20:00:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:00:57,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:00:57,293 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_814 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_814) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)))) (<= (+ main_~i~0 2) c_~N~0) (<= c_~N~0 main_~i~0))) is different from false [2023-04-01 20:00:57,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:57,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 31 [2023-04-01 20:00:57,469 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 20:00:57,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2023-04-01 20:00:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 13 not checked. [2023-04-01 20:00:57,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:00:57,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228411249] [2023-04-01 20:00:57,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:00:57,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50052234] [2023-04-01 20:00:57,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50052234] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:00:57,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:00:57,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-04-01 20:00:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893765963] [2023-04-01 20:00:57,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:00:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 20:00:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:00:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 20:00:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=206, Unknown=3, NotChecked=30, Total=306 [2023-04-01 20:00:57,505 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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:00:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:00:57,916 INFO L93 Difference]: Finished difference Result 208 states and 259 transitions. [2023-04-01 20:00:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:00:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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 55 [2023-04-01 20:00:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:00:57,917 INFO L225 Difference]: With dead ends: 208 [2023-04-01 20:00:57,918 INFO L226 Difference]: Without dead ends: 202 [2023-04-01 20:00:57,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=434, Unknown=3, NotChecked=46, Total=650 [2023-04-01 20:00:57,919 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 20:00:57,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 134 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2023-04-01 20:00:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-04-01 20:00:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2023-04-01 20:00:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 178 states have internal predecessors, (226), 4 states have call successors, (4), 4 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:00:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 232 transitions. [2023-04-01 20:00:57,972 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 232 transitions. Word has length 55 [2023-04-01 20:00:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:00:57,973 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 232 transitions. [2023-04-01 20:00:57,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 18 states have internal predecessors, (53), 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:00:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 232 transitions. [2023-04-01 20:00:57,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 20:00:57,974 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:00:57,974 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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:00:57,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-04-01 20:00:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:58,183 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:00:58,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:00:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash -808421697, now seen corresponding path program 3 times [2023-04-01 20:00:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:00:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158019312] [2023-04-01 20:00:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:00:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:00:58,194 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:00:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777362370] [2023-04-01 20:00:58,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:00:58,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:00:58,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:00:58,196 INFO L229 MonitoredProcess]: Starting monitored process 19 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:00:58,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-04-01 20:00:58,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 20:00:58,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:00:58,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 20:00:58,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:00:58,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-01 20:00:58,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:58,486 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 21 treesize of output 20 [2023-04-01 20:00:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:00:58,533 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 23 treesize of output 22 [2023-04-01 20:00:58,583 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-04-01 20:00:58,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-04-01 20:00:58,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:00:58,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-04-01 20:00:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:00:58,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:02,260 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_main_~i~0_265 Int) (v_ArrVal_881 Int) (v_main_~i~0_263 Int)) (or (= 1 (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_881) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)) v_ArrVal_884) (+ c_main_~a~0.offset (* 4 v_main_~i~0_263)))) (<= c_~N~0 v_main_~i~0_263) (< v_main_~i~0_263 (+ v_main_~i~0_265 1)) (< (+ v_main_~i~0_263 1) c_~N~0))) is different from false [2023-04-01 20:01:04,295 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_266 Int)) (or (< (+ c_main_~i~0 1) v_main_~i~0_266) (forall ((v_ArrVal_884 Int) (v_main_~i~0_265 Int) (v_ArrVal_881 Int) (v_main_~i~0_263 Int)) (or (<= c_~N~0 v_main_~i~0_263) (< v_main_~i~0_263 (+ v_main_~i~0_265 1)) (< (+ v_main_~i~0_263 1) c_~N~0) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_266) c_main_~a~0.offset) v_ArrVal_881) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)) v_ArrVal_884) (+ c_main_~a~0.offset (* 4 v_main_~i~0_263))) 1))))) is different from false [2023-04-01 20:01:14,388 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_main_~i~0_265 Int) (v_main_~i~0_266 Int) (v_main_~i~0_263 Int) (v_ArrVal_881 Int) (v_ArrVal_879 Int)) (or (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset v_ArrVal_879) (+ (* 4 v_main_~i~0_266) c_main_~a~0.offset) v_ArrVal_881) (+ c_main_~a~0.offset (* 4 v_main_~i~0_265)) v_ArrVal_884) (+ c_main_~a~0.offset (* 4 v_main_~i~0_263))) 1) (<= c_~N~0 v_main_~i~0_263) (< 1 v_main_~i~0_266) (< v_main_~i~0_263 (+ v_main_~i~0_265 1)) (< (+ v_main_~i~0_263 1) c_~N~0))) is different from false [2023-04-01 20:01:15,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-04-01 20:01:15,337 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 6710 treesize of output 6518 [2023-04-01 20:01:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 10 not checked. [2023-04-01 20:01:15,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158019312] [2023-04-01 20:01:15,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:01:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777362370] [2023-04-01 20:01:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777362370] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:15,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:01:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2023-04-01 20:01:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301862386] [2023-04-01 20:01:15,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:15,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-04-01 20:01:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-04-01 20:01:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=638, Unknown=11, NotChecked=168, Total=992 [2023-04-01 20:01:15,471 INFO L87 Difference]: Start difference. First operand 185 states and 232 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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:01:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:20,471 INFO L93 Difference]: Finished difference Result 196 states and 243 transitions. [2023-04-01 20:01:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 20:01:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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 55 [2023-04-01 20:01:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:20,472 INFO L225 Difference]: With dead ends: 196 [2023-04-01 20:01:20,472 INFO L226 Difference]: Without dead ends: 138 [2023-04-01 20:01:20,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=588, Invalid=1760, Unknown=16, NotChecked=288, Total=2652 [2023-04-01 20:01:20,473 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:20,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 216 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 346 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2023-04-01 20:01:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-04-01 20:01:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2023-04-01 20:01:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.2142857142857142) internal successors, (153), 126 states have internal predecessors, (153), 4 states have call successors, (4), 4 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:01:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2023-04-01 20:01:20,508 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 55 [2023-04-01 20:01:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:20,508 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2023-04-01 20:01:20,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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:01:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2023-04-01 20:01:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-04-01 20:01:20,509 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:20,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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:01:20,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:20,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:20,711 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:20,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1258309819, now seen corresponding path program 11 times [2023-04-01 20:01:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353298040] [2023-04-01 20:01:20,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:20,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:01:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:01:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:20,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353298040] [2023-04-01 20:01:20,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353298040] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:01:20,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102917882] [2023-04-01 20:01:20,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:01:20,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:20,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:20,893 INFO L229 MonitoredProcess]: Starting monitored process 20 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:01:20,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-04-01 20:01:21,130 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-04-01 20:01:21,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:21,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 20:01:21,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:21,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102917882] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:21,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:01:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2023-04-01 20:01:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447757240] [2023-04-01 20:01:21,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:21,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 20:01:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:21,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 20:01:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:01:21,341 INFO L87 Difference]: Start difference. First operand 133 states and 159 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:21,795 INFO L93 Difference]: Finished difference Result 217 states and 266 transitions. [2023-04-01 20:01:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 20:01:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2023-04-01 20:01:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:21,796 INFO L225 Difference]: With dead ends: 217 [2023-04-01 20:01:21,796 INFO L226 Difference]: Without dead ends: 197 [2023-04-01 20:01:21,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2023-04-01 20:01:21,798 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 123 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:21,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 83 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:01:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-04-01 20:01:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2023-04-01 20:01:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 4 states have call successors, (4), 4 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:01:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2023-04-01 20:01:21,846 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 57 [2023-04-01 20:01:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:21,847 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2023-04-01 20:01:21,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2023-04-01 20:01:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-01 20:01:21,848 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:21,848 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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:01:21,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:22,055 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:22,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -974182882, now seen corresponding path program 12 times [2023-04-01 20:01:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191236685] [2023-04-01 20:01:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:01:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:01:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191236685] [2023-04-01 20:01:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191236685] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:01:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479710449] [2023-04-01 20:01:22,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:01:22,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:22,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:22,229 INFO L229 MonitoredProcess]: Starting monitored process 21 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:01:22,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-04-01 20:01:22,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-04-01 20:01:22,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:22,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 20:01:22,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:22,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-04-01 20:01:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479710449] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:22,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:01:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2023-04-01 20:01:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160136845] [2023-04-01 20:01:22,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:22,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 20:01:22,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 20:01:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:01:22,583 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:22,847 INFO L93 Difference]: Finished difference Result 194 states and 233 transitions. [2023-04-01 20:01:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 20:01:22,853 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-04-01 20:01:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:22,854 INFO L225 Difference]: With dead ends: 194 [2023-04-01 20:01:22,854 INFO L226 Difference]: Without dead ends: 91 [2023-04-01 20:01:22,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:01:22,855 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 112 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:22,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 75 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:01:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-04-01 20:01:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2023-04-01 20:01:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 71 states have internal predecessors, (83), 4 states have call successors, (4), 4 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:01:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-04-01 20:01:22,876 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 58 [2023-04-01 20:01:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:22,876 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-04-01 20:01:22,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:01:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-04-01 20:01:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:01:22,877 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:22,877 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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:01:22,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:23,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-04-01 20:01:23,084 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:23,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1530161726, now seen corresponding path program 13 times [2023-04-01 20:01:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959085271] [2023-04-01 20:01:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:01:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:01:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 20:01:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959085271] [2023-04-01 20:01:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959085271] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:01:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615271279] [2023-04-01 20:01:24,378 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 20:01:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:24,385 INFO L229 MonitoredProcess]: Starting monitored process 22 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:01:24,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-04-01 20:01:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:01:24,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 82 conjunts are in the unsatisfiable core [2023-04-01 20:01:24,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:24,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:01:24,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:24,642 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 14 treesize of output 16 [2023-04-01 20:01:24,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:24,695 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 14 treesize of output 16 [2023-04-01 20:01:24,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:24,753 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 14 treesize of output 16 [2023-04-01 20:01:24,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:24,815 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 14 treesize of output 16 [2023-04-01 20:01:24,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:24,873 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 14 treesize of output 16 [2023-04-01 20:01:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,024 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 14 treesize of output 16 [2023-04-01 20:01:25,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,050 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 14 treesize of output 16 [2023-04-01 20:01:25,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,082 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 14 treesize of output 16 [2023-04-01 20:01:25,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,109 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 14 treesize of output 16 [2023-04-01 20:01:25,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,130 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 14 treesize of output 16 [2023-04-01 20:01:25,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,208 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 30 treesize of output 25 [2023-04-01 20:01:25,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,341 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:01:25,341 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:01:25,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,508 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:01:25,509 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:01:25,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,658 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:01:25,658 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:01:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:01:25,809 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:01:25,809 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:01:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:01:26,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:27,104 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6))))))))) is different from false [2023-04-01 20:01:28,108 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 c_main_~i~0) (< (+ c_main_~i~0 1) c_~N~0) (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6)))))))))) is different from false [2023-04-01 20:01:28,163 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ c_main_~i~0 1)) (< (+ c_main_~i~0 2) c_~N~0) (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6)))))))))) is different from false [2023-04-01 20:01:28,250 WARN L839 $PredicateComparison]: unable to prove that (or (< (+ c_main_~i~0 3) c_~N~0) (<= c_~N~0 (+ c_main_~i~0 2)) (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6)))))))))) is different from false [2023-04-01 20:01:28,820 WARN L839 $PredicateComparison]: unable to prove that (or (< (+ c_main_~i~0 5) c_~N~0) (<= c_~N~0 (+ c_main_~i~0 4)) (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6)))))))))) is different from false [2023-04-01 20:01:28,891 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:01:28,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 1 [2023-04-01 20:01:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 26 trivial. 32 not checked. [2023-04-01 20:01:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615271279] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:28,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:01:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 24] total 71 [2023-04-01 20:01:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102593027] [2023-04-01 20:01:28,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:28,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-04-01 20:01:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-04-01 20:01:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4038, Unknown=13, NotChecked=660, Total=4970 [2023-04-01 20:01:28,912 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 71 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 67 states have internal predecessors, (121), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:01:30,101 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 3))) (let ((.cse0 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse2 (not (= 3 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))))) (.cse5 (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse9 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse7) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ .cse7 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse8 |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| (+ 9 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 9 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse12)))))))))) (and (or (and (< (+ .cse0 2) .cse1) (<= .cse1 (+ .cse0 3))) .cse2) (or (and (<= 5 c_~N~0) (<= c_~N~0 5)) .cse2) (= c_main_~i~0 2) (<= (mod c_~N~0 4294967296) 536870911) (or .cse2 (let ((.cse3 (+ .cse0 9))) (and (<= .cse1 .cse3) (<= .cse3 .cse1)))) (<= (+ 2 c_main_~a~0.base) |c_main_~#sum~0.base|) (= .cse0 0) (or (let ((.cse4 (+ .cse0 12))) (and (<= .cse4 .cse1) (<= .cse1 .cse4))) .cse2) (or (< (+ c_main_~i~0 3) c_~N~0) (<= c_~N~0 (+ c_main_~i~0 2)) .cse5) (or (let ((.cse6 (+ .cse0 6))) (and (<= .cse6 .cse1) (<= .cse1 .cse6))) .cse2) (or (< c_main_~i~0 c_~N~0) .cse5)))) is different from false [2023-04-01 20:01:31,163 WARN L839 $PredicateComparison]: unable to prove that (and (<= (mod c_~N~0 4294967296) 536870911) (or (<= c_~N~0 (+ c_main_~i~0 3)) (< (+ c_main_~i~0 4) c_~N~0) (let ((.cse1 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse0) .cse1) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse0 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 9 .cse0))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 9 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse1 (+ 15 .cse6))))))))))) is different from false [2023-04-01 20:01:37,151 WARN L839 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 15) (< 4 c_~N~0) (exists ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_329 Int) (main_~a~0.base Int)) (let ((.cse0 (select |c_#memory_int| main_~a~0.base))) (and (= (select .cse0 (+ main_~a~0.offset (* main_~i~0 4))) 3) (<= (+ 2 main_~a~0.base) |c_main_~#sum~0.base|) (= (select .cse0 (+ main_~a~0.offset (* 4 v_main_~i~0_329))) 3)))) (<= c_~N~0 5) (or (<= c_~N~0 (+ c_main_~i~0 3)) (< (+ c_main_~i~0 4) c_~N~0) (let ((.cse2 (* c_~N~0 3))) (and (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|))) (or (< (+ 14 .cse1) .cse2) (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 9 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3))))))) (forall ((v_main_~i~0_334 Int) (v_main_~i~0_332 Int) (main_~i~0 Int) (v_ArrVal_1102 (Array Int Int)) (main_~a~0.offset Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1102))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= (select v_ArrVal_1102 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (not (= 3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_332))))) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ 9 .cse7))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_334))) 3)) (<= .cse2 (+ 15 .cse7))))))))))) is different from false [2023-04-01 20:01:39,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:39,453 INFO L93 Difference]: Finished difference Result 213 states and 256 transitions. [2023-04-01 20:01:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-04-01 20:01:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 67 states have internal predecessors, (121), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 63 [2023-04-01 20:01:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:39,454 INFO L225 Difference]: With dead ends: 213 [2023-04-01 20:01:39,454 INFO L226 Difference]: Without dead ends: 207 [2023-04-01 20:01:39,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 121 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3528 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1019, Invalid=12095, Unknown=28, NotChecked=1864, Total=15006 [2023-04-01 20:01:39,457 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 83 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 220 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 5207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 937 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 256 Invalid, 5207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4019 Invalid, 31 Unknown, 937 Unchecked, 4.8s Time] [2023-04-01 20:01:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-04-01 20:01:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2023-04-01 20:01:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.2337662337662338) internal successors, (190), 154 states have internal predecessors, (190), 4 states have call successors, (4), 4 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:01:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 196 transitions. [2023-04-01 20:01:39,506 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 196 transitions. Word has length 63 [2023-04-01 20:01:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:39,506 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 196 transitions. [2023-04-01 20:01:39,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 67 states have internal predecessors, (121), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:01:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 196 transitions. [2023-04-01 20:01:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:01:39,507 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:39,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 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:01:39,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:39,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-04-01 20:01:39,713 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:39,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2063740992, now seen corresponding path program 4 times [2023-04-01 20:01:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909761631] [2023-04-01 20:01:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:39,726 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:01:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1099947376] [2023-04-01 20:01:39,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:01:39,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:39,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:39,728 INFO L229 MonitoredProcess]: Starting monitored process 23 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:01:39,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-04-01 20:01:39,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:01:39,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:39,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 37 conjunts are in the unsatisfiable core [2023-04-01 20:01:39,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:39,875 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:01:39,949 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 23 treesize of output 13 [2023-04-01 20:01:39,991 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-04-01 20:01:39,991 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 1 case distinctions, treesize of input 25 treesize of output 24 [2023-04-01 20:01:40,033 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 16 treesize of output 18 [2023-04-01 20:01:40,061 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 16 treesize of output 18 [2023-04-01 20:01:40,092 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 16 treesize of output 18 [2023-04-01 20:01:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 20:01:40,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:40,178 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1194) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)) 3)) is different from false [2023-04-01 20:01:40,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-04-01 20:01:40,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:01:40,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2023-04-01 20:01:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 18 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 8 not checked. [2023-04-01 20:01:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909761631] [2023-04-01 20:01:40,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:01:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099947376] [2023-04-01 20:01:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099947376] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:40,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:01:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2023-04-01 20:01:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100716166] [2023-04-01 20:01:40,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 20:01:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:40,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 20:01:40,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=462, Unknown=3, NotChecked=44, Total=600 [2023-04-01 20:01:40,490 INFO L87 Difference]: Start difference. First operand 161 states and 196 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 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:01:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:01:40,959 INFO L93 Difference]: Finished difference Result 272 states and 345 transitions. [2023-04-01 20:01:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 20:01:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 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 63 [2023-04-01 20:01:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:01:40,960 INFO L225 Difference]: With dead ends: 272 [2023-04-01 20:01:40,960 INFO L226 Difference]: Without dead ends: 246 [2023-04-01 20:01:40,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=544, Unknown=3, NotChecked=48, Total=702 [2023-04-01 20:01:40,961 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:01:40,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 158 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 643 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2023-04-01 20:01:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-04-01 20:01:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 213. [2023-04-01 20:01:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 206 states have (on average 1.2378640776699028) internal successors, (255), 206 states have internal predecessors, (255), 4 states have call successors, (4), 4 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:01:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 261 transitions. [2023-04-01 20:01:41,022 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 261 transitions. Word has length 63 [2023-04-01 20:01:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:01:41,022 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 261 transitions. [2023-04-01 20:01:41,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 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:01:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 261 transitions. [2023-04-01 20:01:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-04-01 20:01:41,023 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:01:41,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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:01:41,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-04-01 20:01:41,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:41,225 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:01:41,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:01:41,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1721753214, now seen corresponding path program 4 times [2023-04-01 20:01:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:01:41,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258486384] [2023-04-01 20:01:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:01:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:01:41,243 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:01:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1432858601] [2023-04-01 20:01:41,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:01:41,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:01:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:01:41,245 INFO L229 MonitoredProcess]: Starting monitored process 24 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:01:41,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-04-01 20:01:41,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:01:41,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:01:41,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-01 20:01:41,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:01:41,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-04-01 20:01:41,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-04-01 20:01:41,463 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-04-01 20:01:41,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 33 [2023-04-01 20:01:41,551 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-04-01 20:01:41,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2023-04-01 20:01:41,621 INFO L321 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-04-01 20:01:41,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 48 [2023-04-01 20:01:41,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:01:41,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-04-01 20:01:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-04-01 20:01:41,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:01:56,195 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1272 Int) (v_main_~i~0_395 Int) (v_main_~i~0_390 Int)) (let ((.cse0 (+ v_main_~i~0_390 1))) (or (< .cse0 c_main_~i~0) (< v_main_~i~0_390 (+ 3 v_main_~i~0_395)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_1272) (+ c_main_~a~0.offset (* 4 v_main_~i~0_395)) v_ArrVal_1273) (+ c_main_~a~0.offset (* 4 v_main_~i~0_390))) 1) (< c_main_~i~0 .cse0)))) is different from false [2023-04-01 20:01:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 31 refuted. 0 times theorem prover too weak. 44 trivial. 1 not checked. [2023-04-01 20:01:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:01:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258486384] [2023-04-01 20:01:56,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:01:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432858601] [2023-04-01 20:01:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432858601] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:01:56,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:01:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 23 [2023-04-01 20:01:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488699478] [2023-04-01 20:01:56,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:01:56,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 20:01:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:01:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 20:01:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=369, Unknown=7, NotChecked=40, Total=506 [2023-04-01 20:01:56,481 INFO L87 Difference]: Start difference. First operand 213 states and 261 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:02:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:01,186 INFO L93 Difference]: Finished difference Result 348 states and 436 transitions. [2023-04-01 20:02:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 20:02:01,186 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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 63 [2023-04-01 20:02:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:01,187 INFO L225 Difference]: With dead ends: 348 [2023-04-01 20:02:01,187 INFO L226 Difference]: Without dead ends: 233 [2023-04-01 20:02:01,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=345, Invalid=1133, Unknown=8, NotChecked=74, Total=1560 [2023-04-01 20:02:01,188 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:01,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 170 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 279 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2023-04-01 20:02:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-04-01 20:02:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2023-04-01 20:02:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.2431192660550459) internal successors, (271), 218 states have internal predecessors, (271), 4 states have call successors, (4), 4 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:02:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 277 transitions. [2023-04-01 20:02:01,251 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 277 transitions. Word has length 63 [2023-04-01 20:02:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:01,252 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 277 transitions. [2023-04-01 20:02:01,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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:02:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 277 transitions. [2023-04-01 20:02:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-04-01 20:02:01,253 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:01,253 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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:02:01,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:01,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:01,459 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:01,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 494065600, now seen corresponding path program 14 times [2023-04-01 20:02:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047699366] [2023-04-01 20:02:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:01,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047699366] [2023-04-01 20:02:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047699366] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438659442] [2023-04-01 20:02:01,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 20:02:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:01,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:01,689 INFO L229 MonitoredProcess]: Starting monitored process 25 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:02:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-04-01 20:02:01,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 20:02:01,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:01,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 20:02:01,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:01,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438659442] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:02,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2023-04-01 20:02:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071393855] [2023-04-01 20:02:02,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:02,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 20:02:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 20:02:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:02:02,105 INFO L87 Difference]: Start difference. First operand 225 states and 277 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:02,723 INFO L93 Difference]: Finished difference Result 339 states and 421 transitions. [2023-04-01 20:02:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-04-01 20:02:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-04-01 20:02:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:02,725 INFO L225 Difference]: With dead ends: 339 [2023-04-01 20:02:02,725 INFO L226 Difference]: Without dead ends: 316 [2023-04-01 20:02:02,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 20:02:02,726 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:02,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 71 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 20:02:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-04-01 20:02:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 216. [2023-04-01 20:02:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 209 states have (on average 1.2583732057416268) internal successors, (263), 209 states have internal predecessors, (263), 4 states have call successors, (4), 4 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:02:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 269 transitions. [2023-04-01 20:02:02,790 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 269 transitions. Word has length 65 [2023-04-01 20:02:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:02,791 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 269 transitions. [2023-04-01 20:02:02,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 269 transitions. [2023-04-01 20:02:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-04-01 20:02:02,792 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:02,792 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 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:02:02,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-04-01 20:02:02,999 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:02,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -58323517, now seen corresponding path program 15 times [2023-04-01 20:02:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397639999] [2023-04-01 20:02:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:03,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397639999] [2023-04-01 20:02:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397639999] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:03,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348929077] [2023-04-01 20:02:03,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 20:02:03,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:03,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:03,225 INFO L229 MonitoredProcess]: Starting monitored process 26 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:02:03,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-04-01 20:02:03,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-04-01 20:02:03,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:03,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 20:02:03,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:03,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-04-01 20:02:03,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348929077] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:03,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:03,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2023-04-01 20:02:03,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628013301] [2023-04-01 20:02:03,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 20:02:03,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 20:02:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-04-01 20:02:03,791 INFO L87 Difference]: Start difference. First operand 216 states and 269 transitions. Second operand has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:04,135 INFO L93 Difference]: Finished difference Result 311 states and 381 transitions. [2023-04-01 20:02:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 20:02:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2023-04-01 20:02:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:04,136 INFO L225 Difference]: With dead ends: 311 [2023-04-01 20:02:04,136 INFO L226 Difference]: Without dead ends: 134 [2023-04-01 20:02:04,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 117 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2023-04-01 20:02:04,137 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 150 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:04,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 55 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 20:02:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-04-01 20:02:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2023-04-01 20:02:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 102 states have internal predecessors, (123), 4 states have call successors, (4), 4 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:02:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2023-04-01 20:02:04,170 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 66 [2023-04-01 20:02:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:04,170 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2023-04-01 20:02:04,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 23 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2023-04-01 20:02:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:02:04,171 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:04,171 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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:02:04,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:04,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-04-01 20:02:04,378 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:04,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1998374105, now seen corresponding path program 16 times [2023-04-01 20:02:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12059484] [2023-04-01 20:02:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:06,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:02:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12059484] [2023-04-01 20:02:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12059484] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759747865] [2023-04-01 20:02:06,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 20:02:06,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:06,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:06,136 INFO L229 MonitoredProcess]: Starting monitored process 27 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:02:06,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-04-01 20:02:06,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 20:02:06,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:06,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 96 conjunts are in the unsatisfiable core [2023-04-01 20:02:06,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:06,297 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:02:06,300 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:02:06,337 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 14 treesize of output 16 [2023-04-01 20:02:06,380 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 14 treesize of output 16 [2023-04-01 20:02:06,432 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 14 treesize of output 16 [2023-04-01 20:02:06,477 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 14 treesize of output 16 [2023-04-01 20:02:06,526 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 14 treesize of output 16 [2023-04-01 20:02:06,589 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 14 treesize of output 16 [2023-04-01 20:02:06,799 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 14 treesize of output 16 [2023-04-01 20:02:06,859 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 14 treesize of output 16 [2023-04-01 20:02:06,923 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 14 treesize of output 16 [2023-04-01 20:02:06,980 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 14 treesize of output 16 [2023-04-01 20:02:07,048 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 14 treesize of output 16 [2023-04-01 20:02:07,112 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 14 treesize of output 16 [2023-04-01 20:02:07,191 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 30 treesize of output 25 [2023-04-01 20:02:07,333 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:07,333 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:07,520 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:07,520 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:07,698 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:07,699 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:07,859 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:07,860 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:08,038 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:02:08,038 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:02:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 35 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:02:08,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:09,893 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (main_~i~0 Int) (v_main_~i~0_473 Int) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 15 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= (* c_~N~0 3) (+ 18 .cse2)) (not (= (select v_ArrVal_1535 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))) is different from false [2023-04-01 20:02:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 32 proven. 98 refuted. 3 times theorem prover too weak. 0 trivial. 5 not checked. [2023-04-01 20:02:16,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759747865] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:16,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:16,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 34] total 91 [2023-04-01 20:02:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29948916] [2023-04-01 20:02:16,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:16,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-04-01 20:02:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-04-01 20:02:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=7495, Unknown=48, NotChecked=176, Total=8190 [2023-04-01 20:02:16,765 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 91 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 88 states have internal predecessors, (157), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:19,256 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~N~0 3))) (and (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (main_~i~0 Int) (v_main_~i~0_473 Int) (main_~a~0.offset Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 12 .cse2))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 15 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse3 (+ 18 .cse2)) (not (= (select v_ArrVal_1535 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))) (<= c_~N~0 c_main_~i~0)) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 12 .cse6))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 15 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse3 (+ 18 .cse6)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) (< c_~N~0 (+ c_main_~i~0 2))))) is different from false [2023-04-01 20:02:34,271 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (* c_~N~0 3))) (let ((.cse5 (select |c_#memory_int| c_main_~a~0.base)) (.cse10 (< c_main_~i~0 3)) (.cse14 (< c_main_~i~0 5)) (.cse21 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse0 (< c_main_~i~0 1)) (.cse4 (* c_main_~i~0 3)) (.cse15 (< c_main_~i~0 4)) (.cse6 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse34 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse35 (select .cse34 |c_main_~#sum~0.base|))) (let ((.cse36 (select .cse35 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse34 |c_main_~#sum~0.base| (store .cse35 |c_main_~#sum~0.offset| (+ 12 .cse36))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse34 |c_main_~#sum~0.base| (store .cse35 |c_main_~#sum~0.offset| (+ 15 .cse36))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse20 (+ 18 .cse36)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))))) (and (or .cse0 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 12 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 15 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 2 .cse3) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (exists ((main_~i~0 Int)) (= 3 (select .cse5 (+ c_main_~a~0.offset (* main_~i~0 4))))) (or .cse6 (< c_~N~0 (+ c_main_~i~0 5))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 12 .cse9))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 15 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 8 .cse9) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse10) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse11 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.base|))) (let ((.cse13 (select .cse12 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse11 |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ 12 .cse13))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse11 |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ 15 .cse13))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 14 .cse13) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse14) (or .cse15 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse16 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.base|))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 12 .cse18))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 15 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ .cse18 11) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (or (not (= 3 |c_main_#t~mem12|)) (let ((.cse19 (+ .cse21 (select .cse5 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 12))) (and (<= .cse19 .cse20) (<= .cse20 .cse19)))) (<= 6 c_~N~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or .cse10 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse22 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse23 (select .cse22 |c_main_~#sum~0.base|))) (let ((.cse24 (select .cse23 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse22 |c_main_~#sum~0.base| (store .cse23 |c_main_~#sum~0.offset| (+ 12 .cse24))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse22 |c_main_~#sum~0.base| (store .cse23 |c_main_~#sum~0.offset| (+ 15 .cse24))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 10 .cse24)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse25 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse26 (select .cse25 |c_main_~#sum~0.base|))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ 12 .cse27))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ 15 .cse27))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 16 .cse27)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse14) (= .cse21 3) (or .cse0 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse28 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse29 (select .cse28 |c_main_~#sum~0.base|))) (let ((.cse30 (select .cse29 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ 12 .cse30))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ 15 .cse30))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 4 .cse30)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse31 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse32 (select .cse31 |c_main_~#sum~0.base|))) (let ((.cse33 (select .cse32 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ 12 .cse33))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse31 |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| (+ 15 .cse33))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 13 .cse33)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse15) (or .cse6 (< c_~N~0 6) (< (+ c_main_~i~0 1) c_~N~0)) (<= c_~N~0 6)))) is different from false [2023-04-01 20:02:35,559 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~N~0 3))) (let ((.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse5 (< c_main_~i~0 5)) (.cse12 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse6 (< c_main_~i~0 4)) (.cse20 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse27 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse28 (select .cse27 |c_main_~#sum~0.base|))) (let ((.cse29 (select .cse28 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ 12 .cse29))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse27 |c_main_~#sum~0.base| (store .cse28 |c_main_~#sum~0.offset| (+ 15 .cse29))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse11 (+ 18 .cse29)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (.cse4 (* c_main_~i~0 3)) (.cse19 (< c_main_~i~0 2))) (and (exists ((main_~i~0 Int)) (= 3 (select .cse0 (+ c_main_~a~0.offset (* main_~i~0 4))))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 12 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 15 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 14 .cse3) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse5) (or .cse6 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 12 .cse9))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 15 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ .cse9 11) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (or (not (= 3 |c_main_#t~mem12|)) (let ((.cse10 (+ .cse12 (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) 12))) (and (<= .cse10 .cse11) (<= .cse11 .cse10)))) (<= 6 c_~N~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 12 .cse15))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 15 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 16 .cse15)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse5) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse16 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.base|))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 12 .cse18))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 15 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 7 .cse18)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse19) (or .cse20 (< c_~N~0 (+ c_main_~i~0 4))) (= .cse12 3) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.base|))) (let ((.cse23 (select .cse22 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ 12 .cse23))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ 15 .cse23))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 13 .cse23)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse6) (or .cse20 (< c_~N~0 6) (< (+ c_main_~i~0 1) c_~N~0)) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse24 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse25 (select .cse24 |c_main_~#sum~0.base|))) (let ((.cse26 (select .cse25 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse24 |c_main_~#sum~0.base| (store .cse25 |c_main_~#sum~0.offset| (+ 12 .cse26))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse24 |c_main_~#sum~0.base| (store .cse25 |c_main_~#sum~0.offset| (+ 15 .cse26))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 5 .cse26) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse19) (<= c_~N~0 6)))) is different from false [2023-04-01 20:02:52,343 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~N~0 3))) (let ((.cse5 (< c_main_~i~0 3)) (.cse0 (select |c_#memory_int| c_main_~a~0.base)) (.cse17 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse28 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse29 (select .cse28 |c_main_~#sum~0.base|))) (let ((.cse30 (select .cse29 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ 12 .cse30))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ 15 .cse30))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse21 (+ 18 .cse30)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (.cse9 (< c_main_~i~0 0)) (.cse4 (* c_main_~i~0 3)) (.cse16 (< c_main_~i~0 2))) (and (exists ((main_~i~0 Int)) (= 3 (select .cse0 (+ c_main_~a~0.offset (* main_~i~0 4))))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 12 .cse3))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ 15 .cse3))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 8 .cse3) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse5) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 12 .cse8))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 15 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ .cse8 1)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse9) (<= 6 c_~N~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (or .cse5 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 12 .cse12))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 15 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 10 .cse12)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (= (select .cse0 (+ (* c_main_~i~0 4) c_main_~a~0.offset)) |c_main_#t~mem12|) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 12 .cse15))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 15 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse4 (+ 7 .cse15)) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse16) (or .cse17 (< c_~N~0 6)) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 3) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (main_~i~0 Int) (v_main_~i~0_473 Int) (main_~a~0.offset Int)) (let ((.cse18 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.base|))) (let ((.cse20 (select .cse19 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse18 |c_main_~#sum~0.base| (store .cse19 |c_main_~#sum~0.offset| (+ 12 .cse20))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse18 |c_main_~#sum~0.base| (store .cse19 |c_main_~#sum~0.offset| (+ 15 .cse20))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (= .cse21 (+ 18 .cse20)) (not (= (select v_ArrVal_1535 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))) (<= c_~N~0 c_main_~i~0)) (or .cse17 (< c_~N~0 (+ c_main_~i~0 2))) (or .cse9 (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse22 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse23 (select .cse22 |c_main_~#sum~0.base|))) (let ((.cse24 (select .cse23 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse22 |c_main_~#sum~0.base| (store .cse23 |c_main_~#sum~0.offset| (+ 12 .cse24))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse22 |c_main_~#sum~0.base| (store .cse23 |c_main_~#sum~0.offset| (+ 15 .cse24))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< .cse24 1) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset)))))))))) (or (forall ((v_ArrVal_1535 (Array Int Int)) (v_main_~i~0_475 Int) (v_main_~i~0_473 Int) (v_main_~i~0_482 Int) (main_~a~0.offset Int)) (let ((.cse25 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_1535))) (let ((.cse26 (select .cse25 |c_main_~#sum~0.base|))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ 12 .cse27))) c_main_~a~0.base) (+ (* 4 v_main_~i~0_475) main_~a~0.offset)))) (not (= (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ 15 .cse27))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_473))) 3)) (< (+ 5 .cse27) .cse4) (not (= 3 (select v_ArrVal_1535 (+ (* 4 v_main_~i~0_482) main_~a~0.offset))))))))) .cse16) (<= c_~N~0 6)))) is different from false [2023-04-01 20:02:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:54,672 INFO L93 Difference]: Finished difference Result 298 states and 364 transitions. [2023-04-01 20:02:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-04-01 20:02:54,673 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 88 states have internal predecessors, (157), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2023-04-01 20:02:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:54,674 INFO L225 Difference]: With dead ends: 298 [2023-04-01 20:02:54,674 INFO L226 Difference]: Without dead ends: 292 [2023-04-01 20:02:54,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 154 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5464 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=1701, Invalid=20907, Unknown=62, NotChecked=1510, Total=24180 [2023-04-01 20:02:54,676 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 165 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 4897 mSolverCounterSat, 398 mSolverCounterUnsat, 243 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 6299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 4897 IncrementalHoareTripleChecker+Invalid, 243 IncrementalHoareTripleChecker+Unknown, 761 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:54,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 250 Invalid, 6299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 4897 Invalid, 243 Unknown, 761 Unchecked, 10.0s Time] [2023-04-01 20:02:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-04-01 20:02:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 256. [2023-04-01 20:02:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 249 states have (on average 1.2530120481927711) internal successors, (312), 249 states have internal predecessors, (312), 4 states have call successors, (4), 4 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:02:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 318 transitions. [2023-04-01 20:02:54,751 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 318 transitions. Word has length 71 [2023-04-01 20:02:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:54,751 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 318 transitions. [2023-04-01 20:02:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 89 states have (on average 1.7640449438202248) internal successors, (157), 88 states have internal predecessors, (157), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 318 transitions. [2023-04-01 20:02:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:02:54,752 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:54,752 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 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:02:54,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:54,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-04-01 20:02:54,953 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:54,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1297309527, now seen corresponding path program 5 times [2023-04-01 20:02:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:54,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106415014] [2023-04-01 20:02:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:54,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:54,966 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:02:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211603408] [2023-04-01 20:02:54,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:02:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:54,968 INFO L229 MonitoredProcess]: Starting monitored process 28 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:02:54,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-04-01 20:02:55,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-04-01 20:02:55,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:55,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 44 conjunts are in the unsatisfiable core [2023-04-01 20:02:55,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:55,377 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:02:55,552 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 11 [2023-04-01 20:02:55,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:02:55,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-04-01 20:02:55,668 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 14 treesize of output 16 [2023-04-01 20:02:55,710 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 14 treesize of output 16 [2023-04-01 20:02:55,749 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 14 treesize of output 16 [2023-04-01 20:02:55,797 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 14 treesize of output 16 [2023-04-01 20:02:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 77 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-04-01 20:02:55,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:55,908 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1642) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 3)) is different from false [2023-04-01 20:02:55,917 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1642) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 8)))) is different from false [2023-04-01 20:02:55,935 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1642) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 12)))) is different from false [2023-04-01 20:02:55,948 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1642 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_1642) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 16)) 3)) is different from false [2023-04-01 20:02:56,158 INFO L321 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-04-01 20:02:56,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 41 [2023-04-01 20:02:56,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:02:56,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-04-01 20:02:56,174 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 7 treesize of output 3 [2023-04-01 20:02:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 38 trivial. 26 not checked. [2023-04-01 20:02:56,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106415014] [2023-04-01 20:02:56,377 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:02:56,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211603408] [2023-04-01 20:02:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211603408] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:56,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:02:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2023-04-01 20:02:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812210727] [2023-04-01 20:02:56,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:56,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 20:02:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 20:02:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=787, Unknown=10, NotChecked=244, Total=1190 [2023-04-01 20:02:56,379 INFO L87 Difference]: Start difference. First operand 256 states and 318 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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:02:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:57,314 INFO L93 Difference]: Finished difference Result 467 states and 596 transitions. [2023-04-01 20:02:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 20:02:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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 71 [2023-04-01 20:02:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:57,316 INFO L225 Difference]: With dead ends: 467 [2023-04-01 20:02:57,316 INFO L226 Difference]: Without dead ends: 438 [2023-04-01 20:02:57,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=892, Unknown=10, NotChecked=260, Total=1332 [2023-04-01 20:02:57,317 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:57,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 331 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1110 Invalid, 0 Unknown, 381 Unchecked, 0.7s Time] [2023-04-01 20:02:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-04-01 20:02:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 393. [2023-04-01 20:02:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 386 states have (on average 1.2590673575129534) internal successors, (486), 386 states have internal predecessors, (486), 4 states have call successors, (4), 4 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:02:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 492 transitions. [2023-04-01 20:02:57,447 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 492 transitions. Word has length 71 [2023-04-01 20:02:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:57,448 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 492 transitions. [2023-04-01 20:02:57,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 35 states have internal predecessors, (92), 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:02:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 492 transitions. [2023-04-01 20:02:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-04-01 20:02:57,449 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:57,449 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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:02:57,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:57,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-04-01 20:02:57,658 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:57,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -958507357, now seen corresponding path program 5 times [2023-04-01 20:02:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794926155] [2023-04-01 20:02:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:57,670 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:02:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076228608] [2023-04-01 20:02:57,671 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:02:57,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:57,672 INFO L229 MonitoredProcess]: Starting monitored process 29 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:02:57,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-04-01 20:02:58,175 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-04-01 20:02:58,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:02:58,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2023-04-01 20:02:58,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:02:58,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-04-01 20:02:58,241 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-04-01 20:02:58,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-04-01 20:02:58,270 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-04-01 20:02:58,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-04-01 20:02:58,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-04-01 20:02:58,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-04-01 20:02:58,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-04-01 20:02:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-04-01 20:02:58,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:58,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-04-01 20:02:58,605 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 16 treesize of output 12 [2023-04-01 20:02:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-04-01 20:02:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794926155] [2023-04-01 20:02:58,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:02:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076228608] [2023-04-01 20:02:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076228608] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:58,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:02:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 21 [2023-04-01 20:02:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520106176] [2023-04-01 20:02:58,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:58,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 20:02:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 20:02:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-04-01 20:02:58,622 INFO L87 Difference]: Start difference. First operand 393 states and 492 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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:02:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:02:59,079 INFO L93 Difference]: Finished difference Result 453 states and 564 transitions. [2023-04-01 20:02:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 20:02:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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 71 [2023-04-01 20:02:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:02:59,080 INFO L225 Difference]: With dead ends: 453 [2023-04-01 20:02:59,080 INFO L226 Difference]: Without dead ends: 259 [2023-04-01 20:02:59,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:02:59,081 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:02:59,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 221 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:02:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-04-01 20:02:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2023-04-01 20:02:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 248 states have (on average 1.2056451612903225) internal successors, (299), 248 states have internal predecessors, (299), 4 states have call successors, (4), 4 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:02:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2023-04-01 20:02:59,186 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 71 [2023-04-01 20:02:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:02:59,187 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2023-04-01 20:02:59,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 21 states have internal predecessors, (63), 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:02:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2023-04-01 20:02:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-01 20:02:59,188 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:02:59,188 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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:02:59,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-04-01 20:02:59,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:59,396 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:02:59,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:02:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1692072279, now seen corresponding path program 17 times [2023-04-01 20:02:59,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:02:59,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829261051] [2023-04-01 20:02:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:02:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:02:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:02:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:02:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:02:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:02:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:02:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829261051] [2023-04-01 20:02:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829261051] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:02:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977566147] [2023-04-01 20:02:59,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 20:02:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:02:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:02:59,713 INFO L229 MonitoredProcess]: Starting monitored process 30 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:02:59,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-04-01 20:03:00,434 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2023-04-01 20:03:00,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:00,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 20:03:00,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:00,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:00,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977566147] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:00,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2023-04-01 20:03:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310402847] [2023-04-01 20:03:00,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:00,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 20:03:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 20:03:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:03:00,834 INFO L87 Difference]: Start difference. First operand 255 states and 305 transitions. Second operand has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:01,683 INFO L93 Difference]: Finished difference Result 361 states and 434 transitions. [2023-04-01 20:03:01,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 20:03:01,684 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2023-04-01 20:03:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:01,685 INFO L225 Difference]: With dead ends: 361 [2023-04-01 20:03:01,685 INFO L226 Difference]: Without dead ends: 335 [2023-04-01 20:03:01,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 127 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=358, Invalid=1364, Unknown=0, NotChecked=0, Total=1722 [2023-04-01 20:03:01,686 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 139 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:01,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 57 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 20:03:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-04-01 20:03:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2023-04-01 20:03:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 228 states have (on average 1.2149122807017543) internal successors, (277), 228 states have internal predecessors, (277), 4 states have call successors, (4), 4 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:03:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2023-04-01 20:03:01,763 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 73 [2023-04-01 20:03:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:01,764 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2023-04-01 20:03:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2023-04-01 20:03:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-04-01 20:03:01,764 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:01,764 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 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:03:01,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:01,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:01,972 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:01,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash 655304762, now seen corresponding path program 18 times [2023-04-01 20:03:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234131038] [2023-04-01 20:03:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:03:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:03:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 54 proven. 52 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234131038] [2023-04-01 20:03:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234131038] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:03:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024533182] [2023-04-01 20:03:02,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:03:02,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:02,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:02,254 INFO L229 MonitoredProcess]: Starting monitored process 31 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:03:02,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-04-01 20:03:02,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-04-01 20:03:02,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:02,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 20:03:02,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:03,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 70 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-04-01 20:03:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024533182] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:03,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:03,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2023-04-01 20:03:03,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771983395] [2023-04-01 20:03:03,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:03,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 20:03:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 20:03:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2023-04-01 20:03:03,237 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 states have internal predecessors, (81), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:03,731 INFO L93 Difference]: Finished difference Result 339 states and 404 transitions. [2023-04-01 20:03:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-01 20:03:03,732 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 states have internal predecessors, (81), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-04-01 20:03:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:03,732 INFO L225 Difference]: With dead ends: 339 [2023-04-01 20:03:03,732 INFO L226 Difference]: Without dead ends: 145 [2023-04-01 20:03:03,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 130 SyntacticMatches, 13 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 20:03:03,733 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 134 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:03,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 78 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 20:03:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-04-01 20:03:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2023-04-01 20:03:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.1858407079646018) internal successors, (134), 113 states have internal predecessors, (134), 4 states have call successors, (4), 4 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:03:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2023-04-01 20:03:03,777 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 74 [2023-04-01 20:03:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:03,778 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2023-04-01 20:03:03,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.0) internal successors, (81), 26 states have internal predecessors, (81), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:03:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2023-04-01 20:03:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 20:03:03,778 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:03,778 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 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:03:03,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-04-01 20:03:03,985 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:03,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 829798370, now seen corresponding path program 19 times [2023-04-01 20:03:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791820913] [2023-04-01 20:03:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 20:03:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 20:03:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 20:03:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791820913] [2023-04-01 20:03:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791820913] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 20:03:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234657036] [2023-04-01 20:03:06,173 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 20:03:06,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:06,174 INFO L229 MonitoredProcess]: Starting monitored process 32 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:03:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-04-01 20:03:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 20:03:06,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 106 conjunts are in the unsatisfiable core [2023-04-01 20:03:06,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:06,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-04-01 20:03:06,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,541 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 14 treesize of output 16 [2023-04-01 20:03:06,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,620 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 14 treesize of output 16 [2023-04-01 20:03:06,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,703 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 14 treesize of output 16 [2023-04-01 20:03:06,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,787 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 14 treesize of output 16 [2023-04-01 20:03:06,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,872 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 14 treesize of output 16 [2023-04-01 20:03:06,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:06,957 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 14 treesize of output 16 [2023-04-01 20:03:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,039 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 14 treesize of output 16 [2023-04-01 20:03:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,284 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 14 treesize of output 16 [2023-04-01 20:03:07,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,309 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 14 treesize of output 16 [2023-04-01 20:03:07,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,334 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 14 treesize of output 16 [2023-04-01 20:03:07,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,361 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 14 treesize of output 16 [2023-04-01 20:03:07,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,381 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 14 treesize of output 16 [2023-04-01 20:03:07,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,403 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 14 treesize of output 16 [2023-04-01 20:03:07,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,426 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 14 treesize of output 16 [2023-04-01 20:03:07,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,526 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 30 treesize of output 25 [2023-04-01 20:03:07,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,716 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:07,716 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:07,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:07,935 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:07,936 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:08,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:08,182 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:08,183 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:08,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:08,450 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:08,450 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:08,750 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:08,750 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:09,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:09,008 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:09,009 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 1 case distinctions, treesize of input 41 treesize of output 39 [2023-04-01 20:03:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-04-01 20:03:09,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:11,899 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))))) is different from false [2023-04-01 20:03:13,675 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 c_main_~i~0) (< (+ c_main_~i~0 1) c_~N~0) (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)))))))))) is different from false [2023-04-01 20:03:13,728 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ c_main_~i~0 1)) (< (+ c_main_~i~0 2) c_~N~0) (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)))))))))) is different from false [2023-04-01 20:03:14,522 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ c_main_~i~0 3)) (< (+ c_main_~i~0 4) c_~N~0) (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)))))))))) is different from false [2023-04-01 20:03:14,630 WARN L839 $PredicateComparison]: unable to prove that (or (< (+ c_main_~i~0 5) c_~N~0) (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))))) (<= c_~N~0 (+ c_main_~i~0 4))) is different from false [2023-04-01 20:03:14,730 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~N~0 (+ c_main_~i~0 5)) (< (+ c_main_~i~0 6) c_~N~0) (let ((.cse3 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse2 21) .cse3)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse3 (+ .cse6 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)))))))))) is different from false [2023-04-01 20:03:15,289 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 20:03:15,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 1 [2023-04-01 20:03:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 57 trivial. 56 not checked. [2023-04-01 20:03:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234657036] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:15,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:03:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32, 30] total 91 [2023-04-01 20:03:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925553249] [2023-04-01 20:03:15,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:15,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-04-01 20:03:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-04-01 20:03:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=6789, Unknown=39, NotChecked=1026, Total=8190 [2023-04-01 20:03:15,315 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 91 states, 89 states have (on average 1.696629213483146) internal successors, (151), 87 states have internal predecessors, (151), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:21,003 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse4 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse3 21) .cse4)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse4 (+ .cse7 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))))))) (and (<= (mod c_~N~0 4294967296) 536870911) (or (<= c_~N~0 (+ c_main_~i~0 6)) (< (+ c_main_~i~0 7) c_~N~0) .cse0) (or (< (+ c_main_~i~0 3) c_~N~0) (<= c_~N~0 (+ c_main_~i~0 2)) .cse0))) is different from false [2023-04-01 20:03:24,123 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse4 (* c_~N~0 3))) (and (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse1 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.base|))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse1 |c_main_~#sum~0.base| (store .cse2 |c_main_~#sum~0.offset| (+ .cse3 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3)) (<= (+ .cse3 21) .cse4)))))) (forall ((main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_639 Int) (v_ArrVal_2034 (Array Int Int)) (v_main_~i~0_637 Int)) (let ((.cse5 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_2034))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.offset|))) (or (not (= 3 (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_637))))) (not (= (select (select (store .cse5 |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| (+ .cse7 15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_639))) 3)) (<= .cse4 (+ .cse7 21)) (not (= (select v_ArrVal_2034 (+ main_~a~0.offset (* main_~i~0 4))) 3))))))))))) (and (or (<= c_~N~0 (+ c_main_~i~0 6)) (< (+ c_main_~i~0 7) c_~N~0) .cse0) (or (< (+ c_main_~i~0 3) c_~N~0) (<= c_~N~0 (+ c_main_~i~0 2)) .cse0))) is different from false [2023-04-01 20:03:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 20:03:37,323 INFO L93 Difference]: Finished difference Result 354 states and 423 transitions. [2023-04-01 20:03:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-04-01 20:03:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 89 states have (on average 1.696629213483146) internal successors, (151), 87 states have internal predecessors, (151), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 79 [2023-04-01 20:03:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 20:03:37,324 INFO L225 Difference]: With dead ends: 354 [2023-04-01 20:03:37,324 INFO L226 Difference]: Without dead ends: 348 [2023-04-01 20:03:37,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 121 SyntacticMatches, 15 SemanticMatches, 143 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 5020 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1109, Invalid=17434, Unknown=121, NotChecked=2216, Total=20880 [2023-04-01 20:03:37,326 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 119 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 5579 mSolverCounterSat, 304 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 7111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 5579 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 1169 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-04-01 20:03:37,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 289 Invalid, 7111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 5579 Invalid, 59 Unknown, 1169 Unchecked, 8.4s Time] [2023-04-01 20:03:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-04-01 20:03:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 281. [2023-04-01 20:03:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.2116788321167884) internal successors, (332), 274 states have internal predecessors, (332), 4 states have call successors, (4), 4 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:03:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 338 transitions. [2023-04-01 20:03:37,435 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 338 transitions. Word has length 79 [2023-04-01 20:03:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 20:03:37,436 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 338 transitions. [2023-04-01 20:03:37,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 89 states have (on average 1.696629213483146) internal successors, (151), 87 states have internal predecessors, (151), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 20:03:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 338 transitions. [2023-04-01 20:03:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 20:03:37,437 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 20:03:37,437 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 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:03:37,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-04-01 20:03:37,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:37,644 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 20:03:37,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 20:03:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1530862948, now seen corresponding path program 6 times [2023-04-01 20:03:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 20:03:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151491526] [2023-04-01 20:03:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 20:03:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 20:03:37,660 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 20:03:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446098189] [2023-04-01 20:03:37,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 20:03:37,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 20:03:37,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 20:03:37,662 INFO L229 MonitoredProcess]: Starting monitored process 33 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:03:37,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-04-01 20:03:38,059 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2023-04-01 20:03:38,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 20:03:38,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 49 conjunts are in the unsatisfiable core [2023-04-01 20:03:38,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 20:03:38,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-04-01 20:03:38,517 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 25 treesize of output 24 [2023-04-01 20:03:38,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:38,667 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 18 treesize of output 20 [2023-04-01 20:03:38,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:38,727 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 18 treesize of output 20 [2023-04-01 20:03:38,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:38,780 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 18 treesize of output 20 [2023-04-01 20:03:38,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:38,819 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 18 treesize of output 20 [2023-04-01 20:03:38,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 20:03:38,868 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 18 treesize of output 20 [2023-04-01 20:03:38,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:03:38,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2023-04-01 20:03:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 32 proven. 96 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-04-01 20:03:39,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:03:41,295 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_2155 (Array Int Int))) (or (<= c_~N~0 (+ main_~i~0 1)) (= 3 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_2155) c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)))) (< (+ main_~i~0 2) c_~N~0))) is different from false [2023-04-01 20:03:47,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 20:03:47,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 44 [2023-04-01 20:03:47,463 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-04-01 20:03:47,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2023-04-01 20:03:47,468 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 9 treesize of output 3 [2023-04-01 20:03:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 97 trivial. 37 not checked. [2023-04-01 20:03:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 20:03:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151491526] [2023-04-01 20:03:57,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 20:03:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446098189] [2023-04-01 20:03:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446098189] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:03:57,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 20:03:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 40 [2023-04-01 20:03:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272936270] [2023-04-01 20:03:57,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 20:03:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-04-01 20:03:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:03:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-04-01 20:03:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1272, Unknown=13, NotChecked=74, Total=1560 [2023-04-01 20:03:57,652 INFO L87 Difference]: Start difference. First operand 281 states and 338 transitions. Second operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 40 states have internal predecessors, (81), 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:04:06,751 WARN L223 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:04:13,865 WARN L223 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 50 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:04:20,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-04-01 20:04:29,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]