/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/modn.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:11:03,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:11:03,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:11:03,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:11:03,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:11:03,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:11:03,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:11:03,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:11:03,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:11:03,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:11:03,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:11:03,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:11:03,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:11:03,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:11:03,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:11:03,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:11:03,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:11:03,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:11:03,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:11:03,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:11:03,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:11:03,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:11:03,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:11:03,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:11:03,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:11:03,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:11:03,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:11:03,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:11:03,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:11:03,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:11:03,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:11:03,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:11:03,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:11:03,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:11:03,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:11:03,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:11:03,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:11:03,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:11:03,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:11:03,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:11:03,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:11:03,101 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 [2022-01-31 01:11:03,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:11:03,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:11:03,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:11:03,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:11:03,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:11:03,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:11:03,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:11:03,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:11:03,119 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:11:03,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:11:03,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:11:03,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:11:03,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:11:03,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:11:03,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:11:03,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 01:11:03,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:11:03,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:11:03,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:11:03,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:11:03,282 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:11:03,283 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modn.c [2022-01-31 01:11:03,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f946bab51/fcf613a4216f49ba907e49fa0cf3b2d3/FLAG53ea63ef4 [2022-01-31 01:11:03,686 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:11:03,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modn.c [2022-01-31 01:11:03,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f946bab51/fcf613a4216f49ba907e49fa0cf3b2d3/FLAG53ea63ef4 [2022-01-31 01:11:03,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f946bab51/fcf613a4216f49ba907e49fa0cf3b2d3 [2022-01-31 01:11:03,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:11:03,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:11:03,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:11:03,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:11:03,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:11:03,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711ce4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03, skipping insertion in model container [2022-01-31 01:11:03,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:11:03,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:11:03,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modn.c[587,600] [2022-01-31 01:11:03,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:11:03,890 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:11:03,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modn.c[587,600] [2022-01-31 01:11:03,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:11:03,928 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:11:03,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03 WrapperNode [2022-01-31 01:11:03,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:11:03,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:11:03,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:11:03,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:11:03,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:11:03,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:11:03,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:11:03,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:11:03,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (1/1) ... [2022-01-31 01:11:03,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:11:03,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:03,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 01:11:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 01:11:04,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:11:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:11:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:11:04,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:11:04,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:11:04,030 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:11:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:11:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:11:04,030 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:11:04,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:11:04,078 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:11:04,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:11:04,205 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:11:04,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:11:04,213 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 01:11:04,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:04 BoogieIcfgContainer [2022-01-31 01:11:04,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:11:04,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:11:04,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:11:04,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:11:04,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:11:03" (1/3) ... [2022-01-31 01:11:04,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d9c6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:04, skipping insertion in model container [2022-01-31 01:11:04,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:03" (2/3) ... [2022-01-31 01:11:04,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d9c6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:04, skipping insertion in model container [2022-01-31 01:11:04,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:04" (3/3) ... [2022-01-31 01:11:04,220 INFO L111 eAbstractionObserver]: Analyzing ICFG modn.c [2022-01-31 01:11:04,223 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:11:04,223 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:11:04,267 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:11:04,271 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 01:11:04,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:11:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-01-31 01:11:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 01:11:04,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:04,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:11:04,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash 199879945, now seen corresponding path program 1 times [2022-01-31 01:11:04,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946960538] [2022-01-31 01:11:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:04,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:11:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:11:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:04,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:04,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946960538] [2022-01-31 01:11:04,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946960538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:11:04,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:11:04,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:11:04,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731230912] [2022-01-31 01:11:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:11:04,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:11:04,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:11:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:11:04,450 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-01-31 01:11:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:04,520 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-01-31 01:11:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:11:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 22 [2022-01-31 01:11:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:04,526 INFO L225 Difference]: With dead ends: 58 [2022-01-31 01:11:04,527 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 01:11:04,529 INFO L932 BasicCegarLoop]: 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 [2022-01-31 01:11:04,533 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:04,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 01:11:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 01:11:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-31 01:11:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:11:04,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 01:11:04,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2022-01-31 01:11:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:04,562 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 01:11:04,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-01-31 01:11:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 01:11:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 01:11:04,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:04,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:11:04,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:11:04,563 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash -386926069, now seen corresponding path program 1 times [2022-01-31 01:11:04,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287820224] [2022-01-31 01:11:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:04,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:11:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:11:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:04,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:04,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287820224] [2022-01-31 01:11:04,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287820224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:11:04,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:11:04,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:11:04,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645184690] [2022-01-31 01:11:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:11:04,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:11:04,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:11:04,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:11:04,649 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-31 01:11:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:04,744 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-01-31 01:11:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:11:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 22 [2022-01-31 01:11:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:04,748 INFO L225 Difference]: With dead ends: 51 [2022-01-31 01:11:04,749 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 01:11:04,759 INFO L932 BasicCegarLoop]: 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 [2022-01-31 01:11:04,759 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:04,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 31 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:11:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 01:11:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-01-31 01:11:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:11:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-01-31 01:11:04,766 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2022-01-31 01:11:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:04,766 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-01-31 01:11:04,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-31 01:11:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-01-31 01:11:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:11:04,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:04,767 INFO L514 BasicCegarLoop]: 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] [2022-01-31 01:11:04,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:11:04,767 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -292108345, now seen corresponding path program 1 times [2022-01-31 01:11:04,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833402540] [2022-01-31 01:11:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:04,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:04,783 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:11:04,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342793593] [2022-01-31 01:11:04,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:04,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:04,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:11:04,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 01:11:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:04,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-31 01:11:04,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:11:04,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:11:04,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:11:05,147 INFO L353 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-01-31 01:11:05,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-01-31 01:11:05,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 01:11:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:05,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:11:19,859 WARN L228 SmtUtils]: Spent 14.05s on a formula simplification. DAG size of input: 46 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:11:35,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833402540] [2022-01-31 01:11:35,817 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:11:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342793593] [2022-01-31 01:11:35,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342793593] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:11:35,818 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 01:11:35,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-01-31 01:11:35,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383908009] [2022-01-31 01:11:35,818 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 01:11:35,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 01:11:35,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 01:11:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=372, Unknown=7, NotChecked=0, Total=462 [2022-01-31 01:11:35,820 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:11:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:36,446 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-01-31 01:11:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 01:11:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-01-31 01:11:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:36,448 INFO L225 Difference]: With dead ends: 48 [2022-01-31 01:11:36,448 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 01:11:36,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=108, Invalid=485, Unknown=7, NotChecked=0, Total=600 [2022-01-31 01:11:36,450 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:36,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 194 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 43 Unchecked, 0.4s Time] [2022-01-31 01:11:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 01:11:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-01-31 01:11:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:11:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-01-31 01:11:36,455 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2022-01-31 01:11:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:36,456 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-01-31 01:11:36,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:11:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-01-31 01:11:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:11:36,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:36,457 INFO L514 BasicCegarLoop]: 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] [2022-01-31 01:11:36,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 01:11:36,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:36,666 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1603857595, now seen corresponding path program 2 times [2022-01-31 01:11:36,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:36,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407169366] [2022-01-31 01:11:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:36,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:36,688 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:11:36,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964191932] [2022-01-31 01:11:36,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:11:36,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:36,698 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:11:36,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 01:11:36,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:11:36,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:11:36,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:11:36,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:11:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:37,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:11:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:37,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:37,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407169366] [2022-01-31 01:11:37,204 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:11:37,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964191932] [2022-01-31 01:11:37,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964191932] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:11:37,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:11:37,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 01:11:37,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953375699] [2022-01-31 01:11:37,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:11:37,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:11:37,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:11:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:11:37,206 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-01-31 01:11:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:37,638 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-01-31 01:11:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:11:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 28 [2022-01-31 01:11:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:37,640 INFO L225 Difference]: With dead ends: 81 [2022-01-31 01:11:37,640 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 01:11:37,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:11:37,641 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:37,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:11:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 01:11:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-01-31 01:11:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:11:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-01-31 01:11:37,646 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 28 [2022-01-31 01:11:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:37,646 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-01-31 01:11:37,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2022-01-31 01:11:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-01-31 01:11:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 01:11:37,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:37,647 INFO L514 BasicCegarLoop]: 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] [2022-01-31 01:11:37,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 01:11:37,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 01:11:37,856 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2055408763, now seen corresponding path program 3 times [2022-01-31 01:11:37,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:37,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475520802] [2022-01-31 01:11:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:37,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:37,874 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:11:37,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1300538409] [2022-01-31 01:11:37,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:11:37,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:37,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:11:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-31 01:11:37,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-31 01:11:37,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:11:37,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-31 01:11:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:11:38,313 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-31 01:11:38,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-01-31 01:11:39,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-01-31 01:11:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 01:11:39,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:11:40,140 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-31 01:11:40,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 129 [2022-01-31 01:11:40,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-01-31 01:11:40,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-01-31 01:11:40,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-01-31 01:11:40,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-01-31 01:11:40,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-01-31 01:11:41,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:41,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475520802] [2022-01-31 01:11:41,654 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:11:41,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300538409] [2022-01-31 01:11:41,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300538409] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 01:11:41,654 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-31 01:11:41,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-01-31 01:11:41,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614064235] [2022-01-31 01:11:41,655 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-31 01:11:41,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:11:41,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:11:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:11:41,656 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:11:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:41,864 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-01-31 01:11:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 01:11:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-01-31 01:11:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:41,865 INFO L225 Difference]: With dead ends: 42 [2022-01-31 01:11:41,865 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:11:41,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-01-31 01:11:41,866 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:41,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-01-31 01:11:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:11:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 01:11:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 01:11:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-01-31 01:11:41,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2022-01-31 01:11:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:41,870 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-01-31 01:11:41,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 01:11:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-01-31 01:11:41,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 01:11:41,871 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:41,871 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:11:41,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-31 01:11:42,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:42,072 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 376522627, now seen corresponding path program 4 times [2022-01-31 01:11:42,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:42,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519327205] [2022-01-31 01:11:42,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:42,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:42,083 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:11:42,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583645734] [2022-01-31 01:11:42,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:11:42,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:42,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:11:42,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-31 01:11:42,131 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:11:42,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:11:42,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-31 01:11:42,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:11:42,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:11:42,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:11:42,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:11:42,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:11:42,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-01-31 01:11:43,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:11:43,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:11:43,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:11:43,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:11:43,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-01-31 01:11:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:43,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:11:46,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_44 Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_44)))) is different from false [2022-01-31 01:12:16,018 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:12:16,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-01-31 01:12:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 01:12:16,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:16,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519327205] [2022-01-31 01:12:16,038 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:16,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583645734] [2022-01-31 01:12:16,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583645734] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:16,038 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:16,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2022-01-31 01:12:16,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906274137] [2022-01-31 01:12:16,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:16,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-31 01:12:16,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-31 01:12:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=589, Unknown=12, NotChecked=50, Total=756 [2022-01-31 01:12:16,040 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:12:18,381 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (= c_main_~i~0 0) (= c_main_~a~0.offset 0) (exists ((~N~0 Int)) (and (= (mod 2 ~N~0) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (< 1 ~N~0) (<= ~N~0 2))) (forall ((v_main_~i~0_44 Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_44))))) is different from false [2022-01-31 01:12:20,389 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_44 Int)) (or (let ((.cse5 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse4 (< .cse5 0))) (let ((.cse1 (not .cse4)) (.cse0 (or (forall ((v_ArrVal_135 Int)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) (and (not .cse2) .cse4))) (.cse3 (< c_~N~0 0))) (and (or (and .cse0 (or (forall ((v_ArrVal_135 Int)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0))) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) .cse1 .cse2)) (not .cse3)) (or (and (or .cse1 .cse2 (forall ((v_ArrVal_135 Int)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0) (* (- 1) c_~N~0))) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0))) .cse0) .cse3))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_44)))) (forall ((v_main_~i~0_44 Int)) (or (let ((.cse6 (and (forall ((v_ArrVal_135 Int)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) (let ((.cse8 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (or (not (< .cse8 0)) (= (mod .cse8 c_~N~0) 0))))) (.cse7 (< c_~N~0 0))) (and (or .cse6 .cse7) (or .cse6 (not .cse7)))) (not (<= 1 v_main_~i~0_44))))) is different from false [2022-01-31 01:12:22,397 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 2) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|))) (exists ((~N~0 Int)) (and (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 2 ~N~0)) (< 1 ~N~0) (<= ~N~0 2))) (= c_main_~a~0.offset 0) (forall ((v_main_~i~0_44 Int)) (or (forall ((v_ArrVal_135 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ (* v_main_~i~0_44 4) c_main_~a~0.offset) v_ArrVal_135) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_44))))) is different from false [2022-01-31 01:12:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:24,794 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-01-31 01:12:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 01:12:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-01-31 01:12:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:24,795 INFO L225 Difference]: With dead ends: 63 [2022-01-31 01:12:24,796 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 01:12:24,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=16, NotChecked=236, Total=1122 [2022-01-31 01:12:24,797 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:24,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 293 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2022-01-31 01:12:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 01:12:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-01-31 01:12:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:12:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-01-31 01:12:24,804 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 30 [2022-01-31 01:12:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:24,804 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-01-31 01:12:24,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:12:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-01-31 01:12:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:12:24,805 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:24,805 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:12:24,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-31 01:12:25,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:25,012 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -768689921, now seen corresponding path program 5 times [2022-01-31 01:12:25,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:25,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349713682] [2022-01-31 01:12:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:25,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:25,038 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:25,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840969000] [2022-01-31 01:12:25,039 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:12:25,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:25,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:12:25,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-31 01:12:25,107 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-31 01:12:25,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:12:25,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 01:12:25,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:25,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:25,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:25,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349713682] [2022-01-31 01:12:25,895 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:25,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840969000] [2022-01-31 01:12:25,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840969000] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:25,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:25,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-01-31 01:12:25,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439335281] [2022-01-31 01:12:25,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:25,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 01:12:25,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 01:12:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-31 01:12:25,898 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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) [2022-01-31 01:12:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:26,948 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2022-01-31 01:12:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 01:12:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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 34 [2022-01-31 01:12:26,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:26,949 INFO L225 Difference]: With dead ends: 141 [2022-01-31 01:12:26,950 INFO L226 Difference]: Without dead ends: 113 [2022-01-31 01:12:26,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-01-31 01:12:26,951 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 137 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:26,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 122 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 01:12:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-31 01:12:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2022-01-31 01:12:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 76 states have internal predecessors, (83), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 01:12:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-01-31 01:12:26,960 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 34 [2022-01-31 01:12:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:26,960 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-01-31 01:12:26,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 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) [2022-01-31 01:12:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-01-31 01:12:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:12:26,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:26,961 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:12:26,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 01:12:27,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:27,176 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2094692671, now seen corresponding path program 6 times [2022-01-31 01:12:27,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:27,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029388597] [2022-01-31 01:12:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:27,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:27,186 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783960976] [2022-01-31 01:12:27,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:12:27,187 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:27,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:27,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:12:27,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-31 01:12:27,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:12:27,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:12:27,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 01:12:27,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:27,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:12:27,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:12:27,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 01:12:27,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 01:12:27,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:27,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-01-31 01:12:28,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:28,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:28,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-01-31 01:12:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:28,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:28,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:12:29,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:29,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-01-31 01:12:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:29,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:37,597 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:12:37,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-31 01:12:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:37,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029388597] [2022-01-31 01:12:37,616 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783960976] [2022-01-31 01:12:37,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783960976] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:37,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:37,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2022-01-31 01:12:37,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094240399] [2022-01-31 01:12:37,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:37,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-31 01:12:37,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-31 01:12:37,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=879, Unknown=2, NotChecked=0, Total=992 [2022-01-31 01:12:37,618 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:12:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:42,035 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-01-31 01:12:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 01:12:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-01-31 01:12:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:42,037 INFO L225 Difference]: With dead ends: 119 [2022-01-31 01:12:42,037 INFO L226 Difference]: Without dead ends: 117 [2022-01-31 01:12:42,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=213, Invalid=1854, Unknown=3, NotChecked=0, Total=2070 [2022-01-31 01:12:42,038 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:42,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 379 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 184 Invalid, 0 Unknown, 410 Unchecked, 0.6s Time] [2022-01-31 01:12:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-31 01:12:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-01-31 01:12:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-31 01:12:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2022-01-31 01:12:42,068 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 34 [2022-01-31 01:12:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:42,070 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2022-01-31 01:12:42,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:12:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-01-31 01:12:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:12:42,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:42,075 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:12:42,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-31 01:12:42,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:42,276 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1945717119, now seen corresponding path program 7 times [2022-01-31 01:12:42,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:42,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138591614] [2022-01-31 01:12:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:42,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:42,287 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601205190] [2022-01-31 01:12:42,287 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:12:42,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:42,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:42,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:12:42,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-31 01:12:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:12:42,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 01:12:42,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:42,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:43,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138591614] [2022-01-31 01:12:43,118 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:43,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601205190] [2022-01-31 01:12:43,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601205190] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:43,118 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:43,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-01-31 01:12:43,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929423893] [2022-01-31 01:12:43,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:43,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 01:12:43,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:43,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 01:12:43,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-01-31 01:12:43,119 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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) [2022-01-31 01:12:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:44,905 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2022-01-31 01:12:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 01:12:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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 34 [2022-01-31 01:12:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:44,907 INFO L225 Difference]: With dead ends: 164 [2022-01-31 01:12:44,907 INFO L226 Difference]: Without dead ends: 120 [2022-01-31 01:12:44,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-01-31 01:12:44,908 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:44,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 336 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 01:12:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-31 01:12:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 89. [2022-01-31 01:12:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 01:12:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-01-31 01:12:44,921 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 34 [2022-01-31 01:12:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:44,921 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-01-31 01:12:44,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 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) [2022-01-31 01:12:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-01-31 01:12:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:12:44,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:44,922 INFO L514 BasicCegarLoop]: 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] [2022-01-31 01:12:44,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-31 01:12:45,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:45,128 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 56996441, now seen corresponding path program 1 times [2022-01-31 01:12:45,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:45,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99099800] [2022-01-31 01:12:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:45,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:45,145 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:45,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476302924] [2022-01-31 01:12:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:45,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:45,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:45,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:12:45,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 01:12:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:12:45,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-31 01:12:45,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:45,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:12:45,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:12:45,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:12:45,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:12:45,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2022-01-31 01:12:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:45,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-01-31 01:12:55,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 20 [2022-01-31 01:12:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:55,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:13:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:13:32,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:13:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99099800] [2022-01-31 01:13:32,347 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:13:32,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476302924] [2022-01-31 01:13:32,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476302924] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:13:32,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:13:32,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2022-01-31 01:13:32,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009927346] [2022-01-31 01:13:32,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:13:32,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-31 01:13:32,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:13:32,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-31 01:13:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=906, Unknown=10, NotChecked=0, Total=1056 [2022-01-31 01:13:32,348 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 33 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 01:13:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:13:34,087 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-01-31 01:13:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-31 01:13:34,088 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-01-31 01:13:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:13:34,088 INFO L225 Difference]: With dead ends: 93 [2022-01-31 01:13:34,088 INFO L226 Difference]: Without dead ends: 72 [2022-01-31 01:13:34,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=168, Invalid=1082, Unknown=10, NotChecked=0, Total=1260 [2022-01-31 01:13:34,089 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 01:13:34,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 303 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 84 Unchecked, 0.6s Time] [2022-01-31 01:13:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-31 01:13:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-01-31 01:13:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 01:13:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-01-31 01:13:34,096 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2022-01-31 01:13:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:13:34,096 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-01-31 01:13:34,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 31 states have internal predecessors, (50), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 01:13:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-01-31 01:13:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:13:34,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:13:34,096 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:13:34,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 01:13:34,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 01:13:34,314 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:13:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:13:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1202543867, now seen corresponding path program 8 times [2022-01-31 01:13:34,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:13:34,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505938391] [2022-01-31 01:13:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:13:34,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:13:34,325 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:13:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1643899144] [2022-01-31 01:13:34,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:13:34,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:13:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:13:34,326 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:13:34,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 01:13:34,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:13:34,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:13:34,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-31 01:13:34,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:13:34,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:13:34,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:13:34,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:13:34,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:13:34,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:13:35,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 01:13:35,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-01-31 01:13:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:13:36,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:13:36,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:13:36,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:13:36,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:13:36,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:13:37,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-01-31 01:13:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:13:37,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:13:40,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_371 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) is different from false [2022-01-31 01:13:46,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int)) (or (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0))))) is different from false [2022-01-31 01:13:48,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)))) is different from false [2022-01-31 01:13:50,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_110 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_110)) (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) is different from false [2022-01-31 01:14:53,811 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:14:53,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2022-01-31 01:14:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 21 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-31 01:14:53,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:14:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505938391] [2022-01-31 01:14:53,830 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:14:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643899144] [2022-01-31 01:14:53,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643899144] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:14:53,830 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:14:53,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 42 [2022-01-31 01:14:53,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686381147] [2022-01-31 01:14:53,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:14:53,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-31 01:14:53,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:14:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-31 01:14:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1228, Unknown=12, NotChecked=300, Total=1722 [2022-01-31 01:14:53,831 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 42 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:14:56,411 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_110 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (let ((.cse5 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse4 (< .cse5 0))) (let ((.cse3 (< c_~N~0 0)) (.cse1 (not .cse4)) (.cse0 (or (and (not .cse2) .cse4) (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0))))) (and (or (and .cse0 (or .cse1 .cse2 (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0) (* (- 1) c_~N~0))) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)))) .cse3) (or (not .cse3) (and (or .cse1 .cse2 (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0))) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0))) .cse0)))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_110)) (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))) (or (forall ((v_main_~i~0_110 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (let ((.cse7 (< c_~N~0 0)) (.cse6 (and (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)) (let ((.cse8 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (or (not (< .cse8 0)) (= (mod .cse8 c_~N~0) 0)))))) (and (or .cse6 .cse7) (or (not .cse7) .cse6))) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)) (not (<= 1 v_main_~i~0_110)))) (< (+ c_main_~i~0 1) c_~N~0))) is different from false [2022-01-31 01:15:04,187 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~N~0 4) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 4) (exists ((~N~0 Int)) (and (<= ~N~0 4) (< 3 ~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)) (mod 4 ~N~0)))) (= c_main_~i~0 0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (forall ((v_main_~i~0_110 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_110)) (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) (< 3 c_~N~0)) is different from false [2022-01-31 01:15:09,719 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_371 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108)))) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) 0)) is different from false [2022-01-31 01:15:11,729 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int)) (or (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0))))) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (exists ((~N~0 Int)) (and (<= ~N~0 4) (< 3 ~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 4 ~N~0)))) (forall ((v_main_~i~0_110 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_110)) (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_371 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108))))) is different from false [2022-01-31 01:15:13,962 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (forall ((v_main_~i~0_109 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_109)) (forall ((v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int)) (or (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)) (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0))))) (= c_main_~a~0.offset 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 4))) (exists ((~N~0 Int)) (and (<= ~N~0 4) (< 3 ~N~0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 4 ~N~0)))) (forall ((v_main_~i~0_110 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_110)) (forall ((v_ArrVal_368 Int) (v_ArrVal_371 Int) (v_ArrVal_370 Int) (v_main_~i~0_108 Int) (v_main_~i~0_109 Int)) (or (= 0 (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_110) c_main_~a~0.offset) v_ArrVal_368) (+ (* 4 v_main_~i~0_109) c_main_~a~0.offset) v_ArrVal_370) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset)) (not (<= (+ v_main_~i~0_110 1) v_main_~i~0_109)) (not (<= (+ v_main_~i~0_109 1) v_main_~i~0_108)))))) (forall ((v_main_~i~0_108 Int)) (or (forall ((v_ArrVal_371 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_108)) v_ArrVal_371) c_main_~a~0.offset) 0)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_108))))) is different from false [2022-01-31 01:15:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:15:14,731 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-01-31 01:15:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 01:15:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-01-31 01:15:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:15:14,732 INFO L225 Difference]: With dead ends: 114 [2022-01-31 01:15:14,732 INFO L226 Difference]: Without dead ends: 112 [2022-01-31 01:15:14,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 4 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 54.3s TimeCoverageRelationStatistics Valid=319, Invalid=2250, Unknown=17, NotChecked=954, Total=3540 [2022-01-31 01:15:14,733 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:15:14,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 455 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 448 Unchecked, 0.4s Time] [2022-01-31 01:15:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-31 01:15:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2022-01-31 01:15:14,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 93 states have internal predecessors, (103), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 01:15:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2022-01-31 01:15:14,746 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 38 [2022-01-31 01:15:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:15:14,746 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2022-01-31 01:15:14,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:15:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-01-31 01:15:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 01:15:14,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:15:14,747 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 01:15:14,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 01:15:14,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:15:14,963 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:15:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:15:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 642052791, now seen corresponding path program 9 times [2022-01-31 01:15:14,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:15:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280567746] [2022-01-31 01:15:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:15:14,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:15:14,979 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:15:14,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257869756] [2022-01-31 01:15:14,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:15:14,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:15:14,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:15:14,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:15:14,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 01:15:15,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-01-31 01:15:15,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:15:15,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-31 01:15:15,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:15:15,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:15:15,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:15:15,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:15:15,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:15:15,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-31 01:15:15,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 01:15:16,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-31 01:15:16,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-01-31 01:15:17,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:15:17,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:15:17,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:15:17,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-31 01:15:18,089 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 01:15:18,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-01-31 01:15:18,825 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-31 01:15:18,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 44 [2022-01-31 01:15:19,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-01-31 01:15:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:15:20,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:15:23,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int) (v_ArrVal_450 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= v_main_~i~0_128 (+ main_~i~0 1))))) is different from false [2022-01-31 01:15:25,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) is different from false [2022-01-31 01:15:27,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_131)) (forall ((v_ArrVal_445 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))))) is different from false [2022-01-31 01:15:29,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_main_~i~0_131 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ c_main_~i~0 1) v_main_~i~0_131)) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) is different from false [2022-01-31 01:15:32,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_132 Int)) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_main_~i~0_131 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_132)))) is different from false [2022-01-31 01:15:50,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (let ((.cse5 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse2 (= (mod .cse5 c_~N~0) 0)) (.cse4 (< .cse5 0))) (let ((.cse1 (not .cse4)) (.cse0 (or (and (not .cse2) .cse4) (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)))) (.cse3 (< c_~N~0 0))) (and (or (and .cse0 (or .cse1 .cse2 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0) (* (- 1) c_~N~0))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)))) .cse3) (or (and (or .cse1 .cse2 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0))) .cse0) (not .cse3)))))) (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= (+ c_main_~i~0 1) v_main_~i~0_132)) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) is different from false [2022-01-31 01:16:03,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= 1 v_main_~i~0_132)) (let ((.cse5 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse1 (= (mod .cse5 c_~N~0) 0)) (.cse4 (< .cse5 0))) (let ((.cse3 (< c_~N~0 0)) (.cse2 (or (and (not .cse1) .cse4) (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)))) (.cse0 (not .cse4))) (and (or (and (or .cse0 .cse1 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (+ (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0) (* (- 1) c_~N~0))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0))) .cse2) .cse3) (or (not .cse3) (and .cse2 (or .cse0 .cse1 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0))))))))) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) is different from false [2022-01-31 01:19:38,988 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-31 01:19:38,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 1 [2022-01-31 01:19:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2022-01-31 01:19:39,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:19:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280567746] [2022-01-31 01:19:39,009 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:19:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257869756] [2022-01-31 01:19:39,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257869756] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:19:39,009 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:19:39,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 53 [2022-01-31 01:19:39,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844848521] [2022-01-31 01:19:39,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:19:39,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-31 01:19:39,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:19:39,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-31 01:19:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1797, Unknown=16, NotChecked=658, Total=2756 [2022-01-31 01:19:39,012 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 53 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:19:49,998 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse13 (< (+ c_main_~i~0 3) c_~N~0)) (.cse38 (< (+ c_main_~i~0 1) c_~N~0)) (.cse12 (< (+ c_main_~i~0 2) c_~N~0))) (and (or (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (let ((.cse11 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 3))) (let ((.cse8 (< .cse11 0)) (.cse2 (= (mod .cse11 c_~N~0) 0))) (let ((.cse5 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse9 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse10 (+ (select .cse9 |c_main_~#sum~0.offset|) 3))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse9 |c_main_~#sum~0.offset| .cse10)) c_main_~a~0.base) c_main_~a~0.offset (mod .cse10 c_~N~0)))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) (and .cse8 (not .cse2)))) (.cse1 (not .cse8)) (.cse0 (< c_~N~0 0))) (and (or (not .cse0) (and (or .cse1 .cse2 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse3 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse4 (+ (select .cse3 |c_main_~#sum~0.offset|) 3))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| .cse4)) c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 (mod .cse4 c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0))) .cse5)) (or (and .cse5 (or .cse1 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse6 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse7 (+ (select .cse6 |c_main_~#sum~0.offset|) 3))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse6 |c_main_~#sum~0.offset| .cse7)) c_main_~a~0.base) c_main_~a~0.offset (+ (mod .cse7 c_~N~0) (* (- 1) c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) .cse2)) .cse0))))) (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= 1 v_main_~i~0_132)) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) (not .cse12) .cse13) (or (< (+ c_main_~i~0 4) c_~N~0) (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= 1 v_main_~i~0_132)) (let ((.cse25 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 4))) (let ((.cse18 (= (mod .cse25 c_~N~0) 0)) (.cse24 (< .cse25 0))) (let ((.cse19 (< c_~N~0 0)) (.cse17 (not .cse24)) (.cse14 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse22 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse23 (+ (select .cse22 |c_main_~#sum~0.offset|) 4))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| .cse23)) c_main_~a~0.base) c_main_~a~0.offset (mod .cse23 c_~N~0)))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) (and .cse24 (not .cse18))))) (and (or (and .cse14 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= 0 (select (store (store (store (store (let ((.cse15 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse16 (+ (select .cse15 |c_main_~#sum~0.offset|) 4))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| .cse16)) c_main_~a~0.base) c_main_~a~0.offset (+ (mod .cse16 c_~N~0) (* (- 1) c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset))) .cse17 .cse18)) .cse19) (or (not .cse19) (and (or .cse17 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse20 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse21 (+ (select .cse20 |c_main_~#sum~0.offset|) 4))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse20 |c_main_~#sum~0.offset| .cse21)) c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 (mod .cse21 c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) .cse18) .cse14)))))) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) (not .cse13)) (< 4 c_~N~0) (not (= |c_main_~#sum~0.base| c_main_~a~0.base)) (= c_main_~a~0.offset 0) (or (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= 1 v_main_~i~0_132)) (let ((.cse37 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (let ((.cse29 (= (mod .cse37 c_~N~0) 0)) (.cse36 (< .cse37 0))) (let ((.cse31 (< c_~N~0 0)) (.cse30 (not .cse36)) (.cse26 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= 0 (select (store (store (store (store (let ((.cse34 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse35 (+ (select .cse34 |c_main_~#sum~0.offset|) 1))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse34 |c_main_~#sum~0.offset| .cse35)) c_main_~a~0.base) c_main_~a~0.offset (mod .cse35 c_~N~0)))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset))) (and .cse36 (not .cse29))))) (and (or (and .cse26 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse27 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse28 (+ (select .cse27 |c_main_~#sum~0.offset|) 1))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| .cse28)) c_main_~a~0.base) c_main_~a~0.offset (+ (mod .cse28 c_~N~0) (* (- 1) c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) .cse29 .cse30)) .cse31) (or (not .cse31) (and (or .cse29 .cse30 (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse32 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse33 (+ (select .cse32 |c_main_~#sum~0.offset|) 1))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse32 |c_main_~#sum~0.offset| .cse33)) c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 (mod .cse33 c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0))) .cse26)))))) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) (not (< c_main_~i~0 c_~N~0)) .cse38) (or (not .cse38) (forall ((v_main_~i~0_131 Int) (v_main_~i~0_132 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= 1 v_main_~i~0_132)) (let ((.cse50 (+ (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 2))) (let ((.cse47 (< .cse50 0)) (.cse42 (= (mod .cse50 c_~N~0) 0))) (let ((.cse39 (or (and .cse47 (not .cse42)) (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse48 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse49 (+ (select .cse48 |c_main_~#sum~0.offset|) 2))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse48 |c_main_~#sum~0.offset| .cse49)) c_main_~a~0.base) c_main_~a~0.offset (mod .cse49 c_~N~0)))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)))) (.cse43 (not .cse47)) (.cse44 (< c_~N~0 0))) (and (or (and .cse39 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse40 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse41 (+ (select .cse40 |c_main_~#sum~0.offset|) 2))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse40 |c_main_~#sum~0.offset| .cse41)) c_main_~a~0.base) c_main_~a~0.offset (+ (mod .cse41 c_~N~0) (* (- 1) c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) .cse42 .cse43)) .cse44) (or (and .cse39 (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_ArrVal_450 Int) (v_ArrVal_447 Int)) (= (select (store (store (store (store (let ((.cse45 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse46 (+ (select .cse45 |c_main_~#sum~0.offset|) 2))) (store (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse45 |c_main_~#sum~0.offset| .cse46)) c_main_~a~0.base) c_main_~a~0.offset (+ c_~N~0 (mod .cse46 c_~N~0))))) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0)) .cse42 .cse43)) (not .cse44)))))) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) .cse12) (<= c_main_~i~0 5) (= (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 5))) is different from true [2022-01-31 01:20:22,164 WARN L228 SmtUtils]: Spent 12.69s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:20:41,008 WARN L228 SmtUtils]: Spent 9.86s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:20:43,054 WARN L838 $PredicateComparison]: unable to prove that (and (< 4 c_~N~0) (= c_main_~i~0 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= 5 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (= c_main_~a~0.offset 0) (<= c_~N~0 5) (= (mod 5 c_~N~0) (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (forall ((v_main_~i~0_132 Int)) (or (forall ((v_ArrVal_445 Int) (v_ArrVal_443 Int) (v_main_~i~0_131 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (= (select (store (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_132) c_main_~a~0.offset) v_ArrVal_443) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= (+ v_main_~i~0_132 1) v_main_~i~0_131)) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1))))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_132))))) is different from false [2022-01-31 01:21:17,385 WARN L228 SmtUtils]: Spent 13.74s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:21:52,420 WARN L228 SmtUtils]: Spent 34.55s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:22:19,850 WARN L228 SmtUtils]: Spent 12.53s on a formula simplification that was a NOOP. DAG size: 189 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:22:21,859 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (< 4 c_~N~0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= 5 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 5 c_~N~0)) (<= c_~N~0 5) (forall ((v_main_~i~0_131 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_131)) (forall ((v_ArrVal_445 Int) (v_ArrVal_450 Int) (v_main_~i~0_130 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (< (+ v_main_~i~0_128 1) c_~N~0) (= (select (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_131)) v_ArrVal_445) (+ c_main_~a~0.offset (* 4 v_main_~i~0_130)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (not (<= v_main_~i~0_128 (+ v_main_~i~0_130 1)))))))) is different from false [2022-01-31 01:22:44,494 WARN L228 SmtUtils]: Spent 6.39s on a formula simplification that was a NOOP. DAG size: 140 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:23:04,755 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 c_main_~i~0) (< 4 c_~N~0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= 5 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 5 c_~N~0)) (<= c_~N~0 5) (forall ((main_~i~0 Int) (v_ArrVal_450 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= v_main_~i~0_128 (+ main_~i~0 1)))))) is different from false [2022-01-31 01:23:06,804 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 c_main_~i~0) (< 4 c_~N~0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (and (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= 5 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)))) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (mod 5 c_~N~0)) (<= c_~N~0 5) (forall ((main_~i~0 Int) (v_ArrVal_450 Int) (v_main_~i~0_128 Int) (v_ArrVal_447 Int)) (or (= (select (store (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) v_ArrVal_447) (+ (* 4 v_main_~i~0_128) c_main_~a~0.offset) v_ArrVal_450) c_main_~a~0.offset) 0) (< (+ v_main_~i~0_128 1) c_~N~0) (not (<= v_main_~i~0_128 (+ main_~i~0 1)))))) is different from false [2022-01-31 01:23:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:23:08,131 INFO L93 Difference]: Finished difference Result 172 states and 194 transitions. [2022-01-31 01:23:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-31 01:23:08,132 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-01-31 01:23:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:23:08,133 INFO L225 Difference]: With dead ends: 172 [2022-01-31 01:23:08,133 INFO L226 Difference]: Without dead ends: 170 [2022-01-31 01:23:08,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 12 IntricatePredicates, 2 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 265.8s TimeCoverageRelationStatistics Valid=457, Invalid=3309, Unknown=64, NotChecked=1572, Total=5402 [2022-01-31 01:23:08,134 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 22 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 01:23:08,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 463 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 183 Invalid, 0 Unknown, 748 Unchecked, 0.8s Time] [2022-01-31 01:23:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-31 01:23:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 125. [2022-01-31 01:23:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 110 states have (on average 1.1454545454545455) internal successors, (126), 111 states have internal predecessors, (126), 8 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 01:23:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-01-31 01:23:08,159 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 42 [2022-01-31 01:23:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:23:08,159 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-01-31 01:23:08,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 52 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 01:23:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-01-31 01:23:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:23:08,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:23:08,160 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2022-01-31 01:23:08,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 01:23:08,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 01:23:08,363 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:23:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:23:08,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1439748049, now seen corresponding path program 2 times [2022-01-31 01:23:08,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:23:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942397910] [2022-01-31 01:23:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:23:08,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:23:08,371 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:23:08,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952587910] [2022-01-31 01:23:08,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:23:08,372 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:23:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:23:08,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 01:23:08,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 01:23:08,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:23:08,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:23:08,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-31 01:23:08,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:23:08,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-31 01:23:08,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-31 01:23:08,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:23:08,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:23:08,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:23:09,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-01-31 01:23:09,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-01-31 01:23:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:10,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-01-31 01:23:11,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-01-31 01:23:11,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:23:11,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-01-31 01:23:27,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 20 [2022-01-31 01:23:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:23:29,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:23:37,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int)) (or (forall ((v_ArrVal_514 Int)) (let ((.cse0 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_147)) v_ArrVal_514))) (or (not (<= (select .cse0 c_main_~a~0.offset) 0)) (= (select .cse0 (+ c_main_~a~0.offset 4)) 0)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_147)))) is different from false [2022-01-31 01:23:53,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_148 Int)) (or (forall ((v_main_~i~0_147 Int) (v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse0 (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* 4 v_main_~i~0_148) c_main_~a~0.offset) v_ArrVal_512) (+ c_main_~a~0.offset (* 4 v_main_~i~0_147)) v_ArrVal_514))) (or (not (<= (+ v_main_~i~0_148 1) v_main_~i~0_147)) (not (<= (select .cse0 c_main_~a~0.offset) 0)) (= (select .cse0 (+ c_main_~a~0.offset 4)) 0)))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_148)))) is different from false [2022-01-31 01:24:59,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_147 Int) (v_main_~i~0_148 Int)) (or (not (<= (+ c_main_~i~0 2) v_main_~i~0_148)) (not (<= (+ v_main_~i~0_148 1) v_main_~i~0_147)) (let ((.cse8 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (let ((.cse3 (= (mod .cse8 c_~N~0) 0)) (.cse6 (< .cse8 0))) (let ((.cse4 (< c_~N~0 0)) (.cse0 (or (and (not .cse3) .cse6) (forall ((v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse7 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0)) (+ (* 4 v_main_~i~0_148) c_main_~a~0.offset) v_ArrVal_512) (+ c_main_~a~0.offset (* 4 v_main_~i~0_147)) v_ArrVal_514))) (or (not (<= (select .cse7 c_main_~a~0.offset) 0)) (= (select .cse7 (+ c_main_~a~0.offset 4)) 0)))))) (.cse2 (not .cse6))) (and (or (and .cse0 (or (forall ((v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse1 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) (+ (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0) (* (- 1) c_~N~0))) (+ (* 4 v_main_~i~0_148) c_main_~a~0.offset) v_ArrVal_512) (+ c_main_~a~0.offset (* 4 v_main_~i~0_147)) v_ArrVal_514))) (or (not (<= (select .cse1 c_main_~a~0.offset) 0)) (= (select .cse1 (+ c_main_~a~0.offset 4)) 0)))) .cse2 .cse3)) .cse4) (or (not .cse4) (and .cse0 (or (forall ((v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse5 (store (store (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4) (+ c_~N~0 (mod (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) c_~N~0))) (+ (* 4 v_main_~i~0_148) c_main_~a~0.offset) v_ArrVal_512) (+ c_main_~a~0.offset (* 4 v_main_~i~0_147)) v_ArrVal_514))) (or (not (<= (select .cse5 c_main_~a~0.offset) 0)) (= (select .cse5 (+ c_main_~a~0.offset 4)) 0)))) .cse2 .cse3))))))))) is different from false