/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/mods.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 01:11:18,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 01:11:18,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 01:11:18,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 01:11:18,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 01:11:18,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 01:11:18,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 01:11:18,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 01:11:18,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 01:11:18,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 01:11:18,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 01:11:18,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 01:11:18,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 01:11:18,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 01:11:18,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 01:11:18,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 01:11:18,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 01:11:18,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 01:11:18,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 01:11:18,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 01:11:18,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 01:11:18,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 01:11:18,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 01:11:18,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 01:11:18,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 01:11:18,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 01:11:18,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 01:11:18,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 01:11:18,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 01:11:18,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 01:11:18,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 01:11:18,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 01:11:18,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 01:11:18,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 01:11:18,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 01:11:18,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 01:11:18,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 01:11:18,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 01:11:18,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 01:11:18,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 01:11:18,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 01:11:18,846 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:18,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 01:11:18,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 01:11:18,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 01:11:18,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 01:11:18,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 01:11:18,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 01:11:18,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 01:11:18,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 01:11:18,880 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 01:11:18,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 01:11:18,881 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 01:11:18,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 01:11:18,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 01:11:18,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 01:11:18,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 01:11:18,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 01:11:18,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:11:18,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 01:11:18,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 01:11:18,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 01:11:18,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 01:11:18,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 01:11:18,884 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 01:11:18,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 01:11:18,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 01:11:18,884 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:19,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 01:11:19,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 01:11:19,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 01:11:19,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 01:11:19,141 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 01:11:19,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/mods.c [2022-01-31 01:11:19,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627aead18/faed129982234cec8c47987636e9f212/FLAG6de7d9a8d [2022-01-31 01:11:19,629 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 01:11:19,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c [2022-01-31 01:11:19,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627aead18/faed129982234cec8c47987636e9f212/FLAG6de7d9a8d [2022-01-31 01:11:19,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627aead18/faed129982234cec8c47987636e9f212 [2022-01-31 01:11:19,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 01:11:19,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 01:11:19,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 01:11:19,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 01:11:19,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 01:11:19,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:19" (1/1) ... [2022-01-31 01:11:19,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2902cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:19, skipping insertion in model container [2022-01-31 01:11:19,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 01:11:19" (1/1) ... [2022-01-31 01:11:19,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 01:11:19,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 01:11:19,877 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/mods.c[587,600] [2022-01-31 01:11:19,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:11:19,920 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 01:11:19,934 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/mods.c[587,600] [2022-01-31 01:11:19,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 01:11:19,958 INFO L208 MainTranslator]: Completed translation [2022-01-31 01:11:19,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:19 WrapperNode [2022-01-31 01:11:19,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 01:11:19,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 01:11:19,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 01:11:19,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 01:11:19,969 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:19" (1/1) ... [2022-01-31 01:11:19,969 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:19" (1/1) ... [2022-01-31 01:11:19,985 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:19" (1/1) ... [2022-01-31 01:11:19,985 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:19" (1/1) ... [2022-01-31 01:11:19,992 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:19" (1/1) ... [2022-01-31 01:11:20,002 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:19" (1/1) ... [2022-01-31 01:11:20,010 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:19" (1/1) ... [2022-01-31 01:11:20,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 01:11:20,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 01:11:20,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 01:11:20,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 01:11:20,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:19" (1/1) ... [2022-01-31 01:11:20,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 01:11:20,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:20,049 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:20,077 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:20,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 01:11:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 01:11:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 01:11:20,098 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 01:11:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 01:11:20,099 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 01:11:20,099 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 01:11:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 01:11:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 01:11:20,186 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 01:11:20,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 01:11:20,369 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 01:11:20,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 01:11:20,374 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 01:11:20,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:20 BoogieIcfgContainer [2022-01-31 01:11:20,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 01:11:20,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 01:11:20,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 01:11:20,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 01:11:20,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 01:11:19" (1/3) ... [2022-01-31 01:11:20,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458e43b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:20, skipping insertion in model container [2022-01-31 01:11:20,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 01:11:19" (2/3) ... [2022-01-31 01:11:20,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458e43b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 01:11:20, skipping insertion in model container [2022-01-31 01:11:20,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 01:11:20" (3/3) ... [2022-01-31 01:11:20,397 INFO L111 eAbstractionObserver]: Analyzing ICFG mods.c [2022-01-31 01:11:20,401 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 01:11:20,401 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 01:11:20,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 01:11:20,466 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:20,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 01:11:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:11:20,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:20,491 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:20,492 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1425380239, now seen corresponding path program 1 times [2022-01-31 01:11:20,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403021685] [2022-01-31 01:11:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:20,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:11:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:11:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:20,751 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:20,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:20,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403021685] [2022-01-31 01:11:20,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403021685] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:11:20,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:11:20,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 01:11:20,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478533876] [2022-01-31 01:11:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:11:20,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 01:11:20,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 01:11:20,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 01:11:20,788 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:20,880 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2022-01-31 01:11:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 01:11:20,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 26 [2022-01-31 01:11:20,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:20,888 INFO L225 Difference]: With dead ends: 70 [2022-01-31 01:11:20,888 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 01:11:20,891 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:20,894 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:20,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:11:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 01:11:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-01-31 01:11:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-31 01:11:20,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-01-31 01:11:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:20,927 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-31 01:11:20,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-31 01:11:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-31 01:11:20,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:20,930 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:20,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 01:11:20,931 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1281239155, now seen corresponding path program 1 times [2022-01-31 01:11:20,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:20,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557220470] [2022-01-31 01:11:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:20,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 01:11:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:21,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 01:11:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:21,084 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:21,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557220470] [2022-01-31 01:11:21,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557220470] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 01:11:21,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 01:11:21,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 01:11:21,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151421916] [2022-01-31 01:11:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 01:11:21,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 01:11:21,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 01:11:21,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 01:11:21,087 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:11:21,215 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-01-31 01:11:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 01:11:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 26 [2022-01-31 01:11:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:11:21,219 INFO L225 Difference]: With dead ends: 67 [2022-01-31 01:11:21,219 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 01:11:21,224 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:21,225 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:11:21,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 33 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:11:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 01:11:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2022-01-31 01:11:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-01-31 01:11:21,250 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-01-31 01:11:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:11:21,250 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-01-31 01:11:21,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-01-31 01:11:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 01:11:21,251 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:11:21,251 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:11:21,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 01:11:21,252 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:11:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:11:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1000164587, now seen corresponding path program 1 times [2022-01-31 01:11:21,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:11:21,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024771231] [2022-01-31 01:11:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:21,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:11:21,274 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:11:21,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506512309] [2022-01-31 01:11:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:11:21,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:11:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:11:21,276 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:21,278 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:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:11:21,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-31 01:11:21,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:11:21,458 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:11:21,479 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:11:21,515 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 19 treesize of output 18 [2022-01-31 01:11:21,625 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 0 case distinctions, treesize of input 39 treesize of output 26 [2022-01-31 01:11:21,726 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 0 case distinctions, treesize of input 40 treesize of output 23 [2022-01-31 01:11:21,881 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 0 case distinctions, treesize of input 166 treesize of output 89 [2022-01-31 01:11:22,075 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 36 treesize of output 16 [2022-01-31 01:11:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:11:22,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:11:53,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_50 Int)) (let ((.cse0 (select |c_#memory_int| |c_main_~#sum~0.base|))) (or (not (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse0 |c_main_~#sum~0.offset|)) v_ArrVal_50)) (= (let ((.cse2 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |c_main_~#sum~0.offset| v_ArrVal_50)))) (let ((.cse3 (select .cse2 c_main_~a~0.base))) (let ((.cse1 (+ (select .cse3 c_main_~a~0.offset) v_ArrVal_50))) (mod .cse1 (+ (select (select (store .cse2 c_main_~a~0.base (store .cse3 c_main_~a~0.offset .cse1)) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) 0)))) is different from false [2022-01-31 01:11:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 01:11:58,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:11:58,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024771231] [2022-01-31 01:11:58,006 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:11:58,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506512309] [2022-01-31 01:11:58,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506512309] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:11:58,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:11:58,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-01-31 01:11:58,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058450458] [2022-01-31 01:11:58,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:11:58,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 01:11:58,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:11:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 01:11:58,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=422, Unknown=11, NotChecked=42, Total=552 [2022-01-31 01:11:58,009 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:12:24,934 WARN L228 SmtUtils]: Spent 18.84s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:12:26,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:12:28,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:12:30,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:12:32,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:12:34,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:12:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:37,044 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-01-31 01:12:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 01:12:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2022-01-31 01:12:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:37,046 INFO L225 Difference]: With dead ends: 63 [2022-01-31 01:12:37,046 INFO L226 Difference]: Without dead ends: 61 [2022-01-31 01:12:37,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 64.8s TimeCoverageRelationStatistics Valid=104, Invalid=587, Unknown=15, NotChecked=50, Total=756 [2022-01-31 01:12:37,047 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:37,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 365 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 215 Invalid, 3 Unknown, 101 Unchecked, 9.9s Time] [2022-01-31 01:12:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-31 01:12:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-01-31 01:12:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 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:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-01-31 01:12:37,056 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 34 [2022-01-31 01:12:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:37,056 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-01-31 01:12:37,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:12:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-01-31 01:12:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 01:12:37,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:37,058 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:12:37,092 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:12:37,277 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:12:37,277 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -975117591, now seen corresponding path program 2 times [2022-01-31 01:12:37,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045366282] [2022-01-31 01:12:37,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:37,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:37,303 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [154771082] [2022-01-31 01:12:37,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 01:12:37,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:37,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:37,311 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:12:37,312 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:12:37,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 01:12:37,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:12:37,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:12:37,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:12:37,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 01:12:37,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:37,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045366282] [2022-01-31 01:12:37,582 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:37,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154771082] [2022-01-31 01:12:37,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154771082] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:37,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:37,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 01:12:37,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703921394] [2022-01-31 01:12:37,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:37,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:12:37,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:12:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:12:37,585 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:37,769 INFO L93 Difference]: Finished difference Result 130 states and 149 transitions. [2022-01-31 01:12:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 01:12:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 36 [2022-01-31 01:12:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:37,771 INFO L225 Difference]: With dead ends: 130 [2022-01-31 01:12:37,772 INFO L226 Difference]: Without dead ends: 71 [2022-01-31 01:12:37,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:12:37,773 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:37,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 130 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:12:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-31 01:12:37,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 56. [2022-01-31 01:12:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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:12:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-01-31 01:12:37,781 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 36 [2022-01-31 01:12:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:37,781 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-01-31 01:12:37,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-01-31 01:12:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 01:12:37,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:37,782 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:12:37,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 01:12:37,987 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:12:37,988 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1482775897, now seen corresponding path program 3 times [2022-01-31 01:12:37,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:37,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224088483] [2022-01-31 01:12:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:37,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:38,014 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:38,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295566333] [2022-01-31 01:12:38,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 01:12:38,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:38,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:38,016 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:12:38,034 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:12:38,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-31 01:12:38,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:12:38,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 01:12:38,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:12:38,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-31 01:12:38,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:12:38,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224088483] [2022-01-31 01:12:38,275 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:12:38,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295566333] [2022-01-31 01:12:38,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295566333] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:12:38,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:12:38,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-31 01:12:38,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999285577] [2022-01-31 01:12:38,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:12:38,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 01:12:38,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:12:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 01:12:38,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 01:12:38,279 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:12:38,475 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-01-31 01:12:38,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 01:12:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 38 [2022-01-31 01:12:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:12:38,476 INFO L225 Difference]: With dead ends: 69 [2022-01-31 01:12:38,477 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 01:12:38,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-31 01:12:38,478 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 01:12:38,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 114 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 01:12:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 01:12:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2022-01-31 01:12:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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:12:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-31 01:12:38,487 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2022-01-31 01:12:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:12:38,487 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-31 01:12:38,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-31 01:12:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 01:12:38,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:12:38,494 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:12:38,525 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:12:38,720 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:12:38,721 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:12:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:12:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 6150499, now seen corresponding path program 4 times [2022-01-31 01:12:38,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:12:38,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782588769] [2022-01-31 01:12:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:12:38,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:12:38,746 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:12:38,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146641651] [2022-01-31 01:12:38,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-31 01:12:38,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:12:38,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:12:38,749 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:12:38,762 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:12:38,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-31 01:12:38,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:12:38,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-31 01:12:38,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:12:38,895 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:38,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:38,937 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 23 treesize of output 22 [2022-01-31 01:12:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,002 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 28 treesize of output 30 [2022-01-31 01:12:39,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:12:39,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-01-31 01:12:39,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2022-01-31 01:12:39,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:12:39,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-31 01:12:39,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,471 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-31 01:12:39,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2022-01-31 01:12:39,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:12:39,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 72 [2022-01-31 01:12:39,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,772 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 44 treesize of output 38 [2022-01-31 01:12:39,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:12:39,931 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 36 treesize of output 16 [2022-01-31 01:12:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:12:40,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:12:42,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)))) is different from false [2022-01-31 01:13:28,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_66 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_66)) (forall ((v_main_~i~0_63 Int)) (or (and (forall ((v_ArrVal_186 Int)) (let ((.cse3 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse0 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (not (< .cse0 0)) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse1 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse1 c_main_~a~0.offset (mod (select .cse1 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse1) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse2 (select .cse3 c_main_~a~0.offset))) (or (not (< .cse2 0)) (= (mod .cse2 .cse0) 0)))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse7 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse4 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse4 0) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse5 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse5 c_main_~a~0.offset (mod (select .cse5 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse6 (select .cse7 c_main_~a~0.offset))) (or (not (< .cse6 0)) (= (mod .cse6 .cse4) 0))))))))) (not (<= 1 v_main_~i~0_63)))))) is different from false [2022-01-31 01:15:08,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 Int) (v_main_~i~0_66 Int) (v_ArrVal_180 Int) (v_main_~i~0_63 Int)) (let ((.cse0 (select |c_#memory_int| |c_main_~#sum~0.base|)) (.cse1 (* c_main_~i~0 8))) (or (not (<= 1 v_main_~i~0_66)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |c_main_~#sum~0.offset| v_ArrVal_180)) c_main_~a~0.base) (+ c_main_~a~0.offset .cse1 8))) v_ArrVal_182)) (not (<= (+ (select .cse0 |c_main_~#sum~0.offset|) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1))) v_ArrVal_180)) (and (forall ((v_ArrVal_186 Int)) (let ((.cse8 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse4 (store (let ((.cse9 (select .cse8 c_main_~a~0.base))) (store .cse9 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse9 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse3 (+ (select (select (store .cse8 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (and (let ((.cse2 (select .cse4 c_main_~a~0.offset))) (or (not (< .cse2 0)) (= (mod .cse2 .cse3) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse6 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse5 (store (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse7 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse5 c_main_~a~0.offset (mod (select .cse5 c_main_~a~0.offset) (+ (select (select (store .cse6 c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0))) (not (< .cse3 0))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse16 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse12 (store (let ((.cse17 (select .cse16 c_main_~a~0.base))) (store .cse17 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse17 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse10 (+ (select (select (store .cse16 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse10 0) (and (let ((.cse11 (select .cse12 c_main_~a~0.offset))) (or (not (< .cse11 0)) (= (mod .cse11 .cse10) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse14 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse13 (store (let ((.cse15 (select .cse14 c_main_~a~0.base))) (store .cse15 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse15 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse13 c_main_~a~0.offset (mod (select .cse13 c_main_~a~0.offset) (+ (select (select (store .cse14 c_main_~a~0.base .cse13) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0))))))))) (not (<= 1 v_main_~i~0_63))))) is different from false [2022-01-31 01:15:23,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 Int) (v_main_~i~0_66 Int) (v_ArrVal_180 Int) (v_main_~i~0_63 Int)) (let ((.cse0 (select |c_#memory_int| |c_main_~#sum~0.base|))) (or (not (<= 1 v_main_~i~0_66)) (not (<= (+ (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (select .cse0 |c_main_~#sum~0.offset|)) v_ArrVal_180)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse0 |c_main_~#sum~0.offset| v_ArrVal_180)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) v_ArrVal_182)) (and (forall ((v_ArrVal_186 Int)) (let ((.cse7 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse3 (store (let ((.cse8 (select .cse7 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse8 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse2 (+ (select (select (store .cse7 c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (and (let ((.cse1 (select .cse3 c_main_~a~0.offset))) (or (not (< .cse1 0)) (= (mod .cse1 .cse2) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse5 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse4 (store (let ((.cse6 (select .cse5 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse6 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse4 c_main_~a~0.offset (mod (select .cse4 c_main_~a~0.offset) (+ (select (select (store .cse5 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0))) (not (< .cse2 0))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse15 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse11 (store (let ((.cse16 (select .cse15 c_main_~a~0.base))) (store .cse16 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse16 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse9 (+ (select (select (store .cse15 c_main_~a~0.base .cse11) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse9 0) (and (let ((.cse10 (select .cse11 c_main_~a~0.offset))) (or (not (< .cse10 0)) (= (mod .cse10 .cse9) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse13 (store |c_#memory_int| |c_main_~#sum~0.base| (store (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182)))) (let ((.cse12 (store (let ((.cse14 (select .cse13 c_main_~a~0.base))) (store .cse14 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse14 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse12 c_main_~a~0.offset (mod (select .cse12 c_main_~a~0.offset) (+ (select (select (store .cse13 c_main_~a~0.base .cse12) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0))))))))) (not (<= 1 v_main_~i~0_63))))) is different from false [2022-01-31 01:16:43,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_182 Int) (v_main_~i~0_66 Int) (v_ArrVal_180 Int) (v_main_~i~0_63 Int)) (let ((.cse22 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_179))) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base .cse22))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (or (not (<= 1 v_main_~i~0_66)) (not (<= (+ v_ArrVal_180 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| v_ArrVal_180)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) v_ArrVal_182)) (not (<= 1 v_ArrVal_179)) (not (<= 1 v_main_~i~0_63)) (and (forall ((v_ArrVal_186 Int)) (let ((.cse9 (let ((.cse11 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_179)))) (store .cse11 |c_main_~#sum~0.base| (store (select .cse11 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse4 (store (let ((.cse10 (select .cse9 c_main_~a~0.base))) (store .cse10 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse10 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse2 (+ (select (select (store .cse9 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (not (< .cse2 0)) (and (let ((.cse3 (select .cse4 c_main_~a~0.offset))) (or (not (< .cse3 0)) (= (mod .cse3 .cse2) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse6 (let ((.cse8 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_179)))) (store .cse8 |c_main_~#sum~0.base| (store (select .cse8 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse5 (store (let ((.cse7 (select .cse6 c_main_~a~0.base))) (store .cse7 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse7 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse5 c_main_~a~0.offset (mod (select .cse5 c_main_~a~0.offset) (+ (select (select (store .cse6 c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse19 (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_179)))) (store .cse21 |c_main_~#sum~0.base| (store (select .cse21 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse14 (store (let ((.cse20 (select .cse19 c_main_~a~0.base))) (store .cse20 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse20 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse12 (+ (select (select (store .cse19 c_main_~a~0.base .cse14) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse12 0) (and (let ((.cse13 (select .cse14 c_main_~a~0.offset))) (or (not (< .cse13 0)) (= (mod .cse13 .cse12) 0))) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse16 (let ((.cse18 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8)) v_ArrVal_179)))) (store .cse18 |c_main_~#sum~0.base| (store (select .cse18 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse15 (store (let ((.cse17 (select .cse16 c_main_~a~0.base))) (store .cse17 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse17 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse15 c_main_~a~0.offset (mod (select .cse15 c_main_~a~0.offset) (+ (select (select (store .cse16 c_main_~a~0.base .cse15) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0))))))))) (not (<= (+ (select .cse22 c_main_~a~0.offset) (select .cse1 |c_main_~#sum~0.offset|)) v_ArrVal_180))))))) is different from false [2022-01-31 01:17:38,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_182 Int) (v_main_~i~0_66 Int) (v_ArrVal_180 Int) (v_main_~i~0_63 Int)) (let ((.cse21 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_179))) (let ((.cse22 (store |c_#memory_int| c_main_~a~0.base .cse21))) (let ((.cse20 (select .cse22 |c_main_~#sum~0.base|))) (or (and (forall ((v_ArrVal_186 Int)) (let ((.cse7 (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_179)))) (store .cse9 |c_main_~#sum~0.base| (store (select .cse9 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse6 (store (let ((.cse8 (select .cse7 c_main_~a~0.base))) (store .cse8 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse8 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse0 (+ (select (select (store .cse7 c_main_~a~0.base .cse6) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (not (< .cse0 0)) (and (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse2 (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_179)))) (store .cse4 |c_main_~#sum~0.base| (store (select .cse4 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse1 (store (let ((.cse3 (select .cse2 c_main_~a~0.base))) (store .cse3 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse3 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse1 c_main_~a~0.offset (mod (select .cse1 c_main_~a~0.offset) (+ (select (select (store .cse2 c_main_~a~0.base .cse1) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)) (let ((.cse5 (select .cse6 c_main_~a~0.offset))) (or (= (mod .cse5 .cse0) 0) (not (< .cse5 0)))))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse17 (let ((.cse19 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_179)))) (store .cse19 |c_main_~#sum~0.base| (store (select .cse19 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse16 (store (let ((.cse18 (select .cse17 c_main_~a~0.base))) (store .cse18 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse18 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse15 (+ (select (select (store .cse17 c_main_~a~0.base .cse16) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (and (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse11 (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8) 8) v_ArrVal_179)))) (store .cse13 |c_main_~#sum~0.base| (store (select .cse13 |c_main_~#sum~0.base|) |c_main_~#sum~0.offset| v_ArrVal_182))))) (let ((.cse10 (store (let ((.cse12 (select .cse11 c_main_~a~0.base))) (store .cse12 c_main_~a~0.offset (+ v_ArrVal_182 (select .cse12 c_main_~a~0.offset)))) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse10 c_main_~a~0.offset (mod (select .cse10 c_main_~a~0.offset) (+ (select (select (store .cse11 c_main_~a~0.base .cse10) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)) (let ((.cse14 (select .cse16 c_main_~a~0.offset))) (or (= (mod .cse14 .cse15) 0) (not (< .cse14 0))))) (< .cse15 0))))))) (not (<= 1 v_main_~i~0_66)) (not (<= (+ (select .cse20 |c_main_~#sum~0.offset|) (select .cse21 c_main_~a~0.offset)) v_ArrVal_180)) (not (<= 1 v_ArrVal_179)) (not (<= 1 v_main_~i~0_63)) (not (<= (+ v_ArrVal_180 (select (select (store .cse22 |c_main_~#sum~0.base| (store .cse20 |c_main_~#sum~0.offset| v_ArrVal_180)) c_main_~a~0.base) (+ c_main_~a~0.offset 8))) v_ArrVal_182))))))) is different from false [2022-01-31 01:20:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-01-31 01:20:40,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:20:40,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782588769] [2022-01-31 01:20:40,524 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:20:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146641651] [2022-01-31 01:20:40,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146641651] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:20:40,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:20:40,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 39 [2022-01-31 01:20:40,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458434018] [2022-01-31 01:20:40,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:20:40,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-31 01:20:40,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:20:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-31 01:20:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=879, Unknown=54, NotChecked=402, Total=1482 [2022-01-31 01:20:40,527 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:21:07,539 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse10 (select .cse8 (+ c_main_~a~0.offset 8))) (.cse9 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (and (forall ((v_main_~i~0_66 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_66)) (forall ((v_main_~i~0_63 Int)) (or (and (forall ((v_ArrVal_186 Int)) (let ((.cse3 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse0 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (not (< .cse0 0)) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse1 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse1 c_main_~a~0.offset (mod (select .cse1 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse1) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse2 (select .cse3 c_main_~a~0.offset))) (or (not (< .cse2 0)) (= (mod .cse2 .cse0) 0)))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse7 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse4 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse4 0) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse5 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse5 c_main_~a~0.offset (mod (select .cse5 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse6 (select .cse7 c_main_~a~0.offset))) (or (not (< .cse6 0)) (= (mod .cse6 .cse4) 0))))))))) (not (<= 1 v_main_~i~0_63)))))) (= (+ (select .cse8 (+ c_main_~a~0.offset (* c_main_~i~0 8))) (* (- 1) .cse9)) 1) (= c_main_~i~0 0) (<= 1 .cse10) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (<= (+ .cse10 1) .cse9)))) is different from false [2022-01-31 01:21:25,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) (and (forall ((v_main_~i~0_66 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_66)) (forall ((v_main_~i~0_63 Int)) (or (and (forall ((v_ArrVal_186 Int)) (let ((.cse3 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse0 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse3) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (not (< .cse0 0)) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse1 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse1 c_main_~a~0.offset (mod (select .cse1 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse1) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse2 (select .cse3 c_main_~a~0.offset))) (or (not (< .cse2 0)) (= (mod .cse2 .cse0) 0)))))))) (forall ((v_ArrVal_186 Int)) (let ((.cse7 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (let ((.cse4 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse7) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))) (or (< .cse4 0) (and (forall ((v_ArrVal_191 Int)) (= 0 (select (store (let ((.cse5 (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_66 8)) v_ArrVal_186))) (store .cse5 c_main_~a~0.offset (mod (select .cse5 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset))) (let ((.cse6 (select .cse7 c_main_~a~0.offset))) (or (not (< .cse6 0)) (= (mod .cse6 .cse4) 0))))))))) (not (<= 1 v_main_~i~0_63)))))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (+ .cse8 1)) (<= 2 .cse8))) is different from false [2022-01-31 01:21:28,232 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)))) (= c_main_~i~0 0) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (<= 2 .cse0) (= (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* c_main_~i~0 8))) (let ((.cse1 (+ .cse0 1))) (mod .cse1 .cse1))) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|)))) (< (+ c_main_~a~0.base 1) |c_main_~#sum~0.base|) (= c_main_~a~0.offset 0) (<= 0 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|))) is different from false [2022-01-31 01:21:30,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~i~0_63 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_63)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 8)) v_ArrVal_191) c_main_~a~0.offset) 0)))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse0 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (<= 2 .cse0) (= (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset) (let ((.cse1 (+ .cse0 1))) (mod .cse1 .cse1))) (< (+ c_main_~a~0.base 1) |main_~#sum~0.base|)))) (= c_main_~a~0.offset 0)) is different from false [2022-01-31 01:21:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:21:37,095 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2022-01-31 01:21:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-01-31 01:21:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-01-31 01:21:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:21:37,098 INFO L225 Difference]: With dead ends: 99 [2022-01-31 01:21:37,098 INFO L226 Difference]: Without dead ends: 97 [2022-01-31 01:21:37,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 219.2s TimeCoverageRelationStatistics Valid=197, Invalid=1332, Unknown=71, NotChecked=850, Total=2450 [2022-01-31 01:21:37,100 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:21:37,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 518 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 197 Invalid, 0 Unknown, 511 Unchecked, 0.4s Time] [2022-01-31 01:21:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-31 01:21:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-01-31 01:21:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 85 states have internal predecessors, (97), 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:21:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-01-31 01:21:37,115 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 42 [2022-01-31 01:21:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:21:37,116 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-01-31 01:21:37,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 01:21:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-01-31 01:21:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 01:21:37,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:21:37,117 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:21:37,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-31 01:21:37,318 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:21:37,319 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:21:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:21:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1176543713, now seen corresponding path program 5 times [2022-01-31 01:21:37,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:21:37,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535369270] [2022-01-31 01:21:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:21:37,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:21:37,343 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:21:37,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29111130] [2022-01-31 01:21:37,356 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-31 01:21:37,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:21:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:21:37,358 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:21:37,359 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:21:37,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-31 01:21:37,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:21:37,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:21:37,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:21:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 01:21:37,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:21:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 01:21:37,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:21:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535369270] [2022-01-31 01:21:37,699 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:21:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29111130] [2022-01-31 01:21:37,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29111130] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:21:37,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:21:37,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 01:21:37,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671259523] [2022-01-31 01:21:37,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:21:37,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:21:37,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:21:37,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:21:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:21:37,701 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:21:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:21:38,029 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2022-01-31 01:21:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 01:21:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 44 [2022-01-31 01:21:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:21:38,032 INFO L225 Difference]: With dead ends: 185 [2022-01-31 01:21:38,032 INFO L226 Difference]: Without dead ends: 142 [2022-01-31 01:21:38,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-01-31 01:21:38,034 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 97 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:21:38,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 106 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:21:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-31 01:21:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2022-01-31 01:21:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 100 states have internal predecessors, (110), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 01:21:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-01-31 01:21:38,055 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 44 [2022-01-31 01:21:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:21:38,055 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-01-31 01:21:38,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:21:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-01-31 01:21:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 01:21:38,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:21:38,056 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:21:38,083 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:21:38,275 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:21:38,276 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:21:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:21:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash 237019935, now seen corresponding path program 6 times [2022-01-31 01:21:38,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:21:38,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568621015] [2022-01-31 01:21:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:21:38,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:21:38,293 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:21:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2038057186] [2022-01-31 01:21:38,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-31 01:21:38,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:21:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:21:38,299 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:21:38,315 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:21:38,383 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-31 01:21:38,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 01:21:38,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 01:21:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:21:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 01:21:38,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:21:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-31 01:21:38,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:21:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568621015] [2022-01-31 01:21:38,614 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:21:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038057186] [2022-01-31 01:21:38,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038057186] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:21:38,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:21:38,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-01-31 01:21:38,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376134727] [2022-01-31 01:21:38,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:21:38,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 01:21:38,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:21:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 01:21:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 01:21:38,616 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:21:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:21:39,019 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2022-01-31 01:21:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 01:21:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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 46 [2022-01-31 01:21:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:21:39,021 INFO L225 Difference]: With dead ends: 157 [2022-01-31 01:21:39,021 INFO L226 Difference]: Without dead ends: 111 [2022-01-31 01:21:39,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-01-31 01:21:39,022 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 01:21:39,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 140 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 01:21:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-31 01:21:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2022-01-31 01:21:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.08) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 01:21:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-01-31 01:21:39,041 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 46 [2022-01-31 01:21:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:21:39,041 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-01-31 01:21:39,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 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:21:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-01-31 01:21:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 01:21:39,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:21:39,043 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:21:39,060 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:21:39,247 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:21:39,247 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:21:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:21:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 390148665, now seen corresponding path program 1 times [2022-01-31 01:21:39,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:21:39,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198616438] [2022-01-31 01:21:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:21:39,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:21:39,264 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:21:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706895932] [2022-01-31 01:21:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:21:39,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:21:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:21:39,265 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:21:39,293 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:21:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:21:39,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 76 conjunts are in the unsatisfiable core [2022-01-31 01:21:39,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:21:39,381 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:21:39,389 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:21:39,406 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 23 treesize of output 22 [2022-01-31 01:21:39,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,464 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 28 treesize of output 30 [2022-01-31 01:21:39,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:21:39,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-31 01:21:39,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-31 01:21:39,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:21:39,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2022-01-31 01:21:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-31 01:21:39,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:39,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:21:39,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 107 [2022-01-31 01:21:40,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:21:40,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 67 [2022-01-31 01:21:44,915 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 37 treesize of output 17 [2022-01-31 01:21:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:21:45,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 01:22:02,500 WARN L228 SmtUtils]: Spent 6.84s on a formula simplification. DAG size of input: 78 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:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:22:41,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 01:22:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198616438] [2022-01-31 01:22:41,525 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-31 01:22:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706895932] [2022-01-31 01:22:41,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706895932] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 01:22:41,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-31 01:22:41,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2022-01-31 01:22:41,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851946836] [2022-01-31 01:22:41,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-31 01:22:41,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-01-31 01:22:41,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 01:22:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-01-31 01:22:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1987, Unknown=4, NotChecked=0, Total=2352 [2022-01-31 01:22:41,528 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 49 states, 46 states have (on average 1.608695652173913) internal successors, (74), 47 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 01:22:46,111 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse80 (* c_main_~i~0 8))) (let ((.cse16 (select |c_#memory_int| c_main_~a~0.base)) (.cse23 (+ c_main_~a~0.offset .cse80)) (.cse36 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse36 |c_main_~#sum~0.offset|)) (.cse24 (select .cse16 .cse23))) (let ((.cse15 (select .cse16 c_main_~a~0.offset)) (.cse39 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse35 .cse24))))) (let ((.cse25 (+ .cse35 1)) (.cse42 (select .cse39 c_main_~a~0.base)) (.cse14 (+ c_main_~a~0.offset .cse80 8)) (.cse21 (+ .cse15 .cse35)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse13 (store .cse16 .cse23 1))) (and (let ((.cse12 (store .cse13 .cse14 1))) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base .cse12))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse11 |c_main_~#sum~0.offset|)) (.cse8 (select .cse12 c_main_~a~0.offset))) (let ((.cse9 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8))) c_main_~a~0.base) .cse1))) (let ((.cse3 (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8 .cse9))))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (let ((.cse6 (select .cse3 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ .cse7 .cse8 .cse9 (select .cse6 c_main_~a~0.offset)))))) (store .cse5 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse5 .cse1)))))) (store .cse4 c_main_~a~0.offset (mod (select .cse4 c_main_~a~0.offset) (+ (select (select (store .cse3 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse2 (mod (select .cse0 .cse1) (+ (select (select (store .cse3 c_main_~a~0.base .cse0) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse0 .cse1 .cse2) c_main_~a~0.offset) 0)) (= .cse2 0)))))))))) (or (not (= .cse15 0)) (= (select .cse16 .cse1) 0)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (store .cse16 c_main_~a~0.offset .cse21))) (store .cse20 .cse1 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse20) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse20 .cse1)))))) (store .cse19 c_main_~a~0.offset (mod (select .cse19 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse19) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse17 (mod (select .cse18 .cse1) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse18) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse17 0) (not (= (select (store .cse18 .cse1 .cse17) c_main_~a~0.offset) 0))))) (let ((.cse22 (store .cse16 .cse23 (mod .cse24 .cse25)))) (or (not (= (select .cse22 c_main_~a~0.offset) 0)) (= (select .cse22 .cse1) 0))) (let ((.cse27 (store .cse16 c_main_~a~0.offset (mod .cse15 .cse25)))) (let ((.cse26 (mod (select .cse27 .cse1) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse27) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse26 0) (not (= 0 (select (store .cse27 .cse1 .cse26) c_main_~a~0.offset)))))) (let ((.cse34 (select .cse16 .cse14))) (let ((.cse30 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse34 .cse35))))) (let ((.cse28 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse30 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 .cse35 (select .cse33 c_main_~a~0.offset)))))) (store .cse32 .cse1 (+ (select .cse32 .cse1) (select (select (store .cse30 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 c_main_~a~0.offset (mod (select .cse31 c_main_~a~0.offset) (+ (select (select (store .cse30 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse29 (mod (select .cse28 .cse1) (+ (select (select (store .cse30 c_main_~a~0.base .cse28) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse28 .cse1 .cse29) c_main_~a~0.offset) 0)) (= 0 .cse29)))))) (let ((.cse38 (let ((.cse40 (let ((.cse41 (store .cse42 c_main_~a~0.offset (+ .cse35 .cse24 (select .cse42 c_main_~a~0.offset))))) (store .cse41 .cse1 (+ (select .cse41 .cse1) (select (select (store .cse39 c_main_~a~0.base .cse41) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse40 c_main_~a~0.offset (mod (select .cse40 c_main_~a~0.offset) (+ (select (select (store .cse39 c_main_~a~0.base .cse40) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse37 (mod (select .cse38 .cse1) (+ (select (select (store .cse39 c_main_~a~0.base .cse38) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse37 0) (not (= (select (store .cse38 .cse1 .cse37) c_main_~a~0.offset) 0))))) (let ((.cse54 (store .cse16 .cse14 1))) (let ((.cse52 (store |c_#memory_int| c_main_~a~0.base .cse54))) (let ((.cse53 (select .cse52 |c_main_~#sum~0.base|))) (let ((.cse49 (select .cse54 c_main_~a~0.offset)) (.cse50 (select .cse53 |c_main_~#sum~0.offset|))) (let ((.cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50))) c_main_~a~0.base) .cse1))) (let ((.cse45 (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50 .cse51))))) (let ((.cse44 (let ((.cse46 (let ((.cse47 (let ((.cse48 (select .cse45 c_main_~a~0.base))) (store .cse48 c_main_~a~0.offset (+ .cse49 .cse50 .cse51 (select .cse48 c_main_~a~0.offset)))))) (store .cse47 .cse1 (+ (select .cse47 .cse1) (select (select (store .cse45 c_main_~a~0.base .cse47) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse46 c_main_~a~0.offset (mod (select .cse46 c_main_~a~0.offset) (+ (select (select (store .cse45 c_main_~a~0.base .cse46) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse43 (mod (select .cse44 .cse1) (+ (select (select (store .cse45 c_main_~a~0.base .cse44) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= 0 .cse43) (not (= (select (store .cse44 .cse1 .cse43) c_main_~a~0.offset) 0))))))))))) (let ((.cse61 (select .cse42 .cse14))) (let ((.cse57 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse35 .cse24 .cse61))))) (let ((.cse55 (let ((.cse58 (let ((.cse59 (let ((.cse60 (select .cse57 c_main_~a~0.base))) (store .cse60 c_main_~a~0.offset (+ .cse35 (select .cse60 c_main_~a~0.offset) .cse24 .cse61))))) (store .cse59 .cse1 (+ (select .cse59 .cse1) (select (select (store .cse57 c_main_~a~0.base .cse59) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse58 c_main_~a~0.offset (mod (select .cse58 c_main_~a~0.offset) (+ (select (select (store .cse57 c_main_~a~0.base .cse58) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse56 (mod (select .cse55 .cse1) (+ (select (select (store .cse57 c_main_~a~0.base .cse55) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse55 .cse1 .cse56) c_main_~a~0.offset) 0)) (= .cse56 0)))))) (let ((.cse68 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| .cse21)) c_main_~a~0.base) .cse1))) (let ((.cse64 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse15 .cse35 .cse68))))) (let ((.cse63 (let ((.cse65 (let ((.cse66 (let ((.cse67 (select .cse64 c_main_~a~0.base))) (store .cse67 c_main_~a~0.offset (+ .cse15 .cse35 (select .cse67 c_main_~a~0.offset) .cse68))))) (store .cse66 .cse1 (+ (select (select (store .cse64 c_main_~a~0.base .cse66) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse66 .cse1)))))) (store .cse65 c_main_~a~0.offset (mod (select .cse65 c_main_~a~0.offset) (+ (select (select (store .cse64 c_main_~a~0.base .cse65) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse62 (mod (select .cse63 .cse1) (+ (select (select (store .cse64 c_main_~a~0.base .cse63) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse62 0) (not (= 0 (select (store .cse63 .cse1 .cse62) c_main_~a~0.offset)))))))) (let ((.cse78 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse79 (select .cse78 |c_main_~#sum~0.base|))) (let ((.cse76 (select .cse13 c_main_~a~0.offset)) (.cse77 (select .cse79 |c_main_~#sum~0.offset|))) (let ((.cse75 (select (select (store .cse78 |c_main_~#sum~0.base| (store .cse79 |c_main_~#sum~0.offset| (+ .cse76 .cse77))) c_main_~a~0.base) .cse1))) (let ((.cse71 (store .cse78 |c_main_~#sum~0.base| (store .cse79 |c_main_~#sum~0.offset| (+ .cse75 .cse76 .cse77))))) (let ((.cse70 (let ((.cse72 (let ((.cse73 (let ((.cse74 (select .cse71 c_main_~a~0.base))) (store .cse74 c_main_~a~0.offset (+ .cse75 .cse76 (select .cse74 c_main_~a~0.offset) .cse77))))) (store .cse73 .cse1 (+ (select .cse73 .cse1) (select (select (store .cse71 c_main_~a~0.base .cse73) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse72 c_main_~a~0.offset (mod (select .cse72 c_main_~a~0.offset) (+ (select (select (store .cse71 c_main_~a~0.base .cse72) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse69 (mod (select .cse70 .cse1) (+ (select (select (store .cse71 c_main_~a~0.base .cse70) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse69 0) (not (= (select (store .cse70 .cse1 .cse69) c_main_~a~0.offset) 0)))))))))))))))) is different from false [2022-01-31 01:22:48,127 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse80 (* c_main_~i~0 8))) (let ((.cse16 (select |c_#memory_int| c_main_~a~0.base)) (.cse23 (+ c_main_~a~0.offset .cse80)) (.cse36 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse35 (select .cse36 |c_main_~#sum~0.offset|)) (.cse24 (select .cse16 .cse23))) (let ((.cse15 (select .cse16 c_main_~a~0.offset)) (.cse39 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse35 .cse24))))) (let ((.cse25 (+ .cse35 1)) (.cse42 (select .cse39 c_main_~a~0.base)) (.cse14 (+ c_main_~a~0.offset .cse80 8)) (.cse21 (+ .cse15 .cse35)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse13 (store .cse16 .cse23 1))) (and (let ((.cse12 (store .cse13 .cse14 1))) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base .cse12))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse11 |c_main_~#sum~0.offset|)) (.cse8 (select .cse12 c_main_~a~0.offset))) (let ((.cse9 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8))) c_main_~a~0.base) .cse1))) (let ((.cse3 (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8 .cse9))))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (let ((.cse6 (select .cse3 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ .cse7 .cse8 .cse9 (select .cse6 c_main_~a~0.offset)))))) (store .cse5 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse5 .cse1)))))) (store .cse4 c_main_~a~0.offset (mod (select .cse4 c_main_~a~0.offset) (+ (select (select (store .cse3 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse2 (mod (select .cse0 .cse1) (+ (select (select (store .cse3 c_main_~a~0.base .cse0) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse0 .cse1 .cse2) c_main_~a~0.offset) 0)) (= .cse2 0)))))))))) (or (not (= .cse15 0)) (= (select .cse16 .cse1) 0)) (let ((.cse18 (let ((.cse19 (let ((.cse20 (store .cse16 c_main_~a~0.offset .cse21))) (store .cse20 .cse1 (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse20) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse20 .cse1)))))) (store .cse19 c_main_~a~0.offset (mod (select .cse19 c_main_~a~0.offset) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse19) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse17 (mod (select .cse18 .cse1) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse18) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse17 0) (not (= (select (store .cse18 .cse1 .cse17) c_main_~a~0.offset) 0))))) (let ((.cse22 (store .cse16 .cse23 (mod .cse24 .cse25)))) (or (not (= (select .cse22 c_main_~a~0.offset) 0)) (= (select .cse22 .cse1) 0))) (let ((.cse27 (store .cse16 c_main_~a~0.offset (mod .cse15 .cse25)))) (let ((.cse26 (mod (select .cse27 .cse1) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse27) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse26 0) (not (= 0 (select (store .cse27 .cse1 .cse26) c_main_~a~0.offset)))))) (let ((.cse34 (select .cse16 .cse14))) (let ((.cse30 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse34 .cse35))))) (let ((.cse28 (let ((.cse31 (let ((.cse32 (let ((.cse33 (select .cse30 c_main_~a~0.base))) (store .cse33 c_main_~a~0.offset (+ .cse34 .cse35 (select .cse33 c_main_~a~0.offset)))))) (store .cse32 .cse1 (+ (select .cse32 .cse1) (select (select (store .cse30 c_main_~a~0.base .cse32) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse31 c_main_~a~0.offset (mod (select .cse31 c_main_~a~0.offset) (+ (select (select (store .cse30 c_main_~a~0.base .cse31) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse29 (mod (select .cse28 .cse1) (+ (select (select (store .cse30 c_main_~a~0.base .cse28) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse28 .cse1 .cse29) c_main_~a~0.offset) 0)) (= 0 .cse29)))))) (let ((.cse38 (let ((.cse40 (let ((.cse41 (store .cse42 c_main_~a~0.offset (+ .cse35 .cse24 (select .cse42 c_main_~a~0.offset))))) (store .cse41 .cse1 (+ (select .cse41 .cse1) (select (select (store .cse39 c_main_~a~0.base .cse41) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse40 c_main_~a~0.offset (mod (select .cse40 c_main_~a~0.offset) (+ (select (select (store .cse39 c_main_~a~0.base .cse40) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse37 (mod (select .cse38 .cse1) (+ (select (select (store .cse39 c_main_~a~0.base .cse38) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse37 0) (not (= (select (store .cse38 .cse1 .cse37) c_main_~a~0.offset) 0))))) (let ((.cse54 (store .cse16 .cse14 1))) (let ((.cse52 (store |c_#memory_int| c_main_~a~0.base .cse54))) (let ((.cse53 (select .cse52 |c_main_~#sum~0.base|))) (let ((.cse49 (select .cse54 c_main_~a~0.offset)) (.cse50 (select .cse53 |c_main_~#sum~0.offset|))) (let ((.cse51 (select (select (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50))) c_main_~a~0.base) .cse1))) (let ((.cse45 (store .cse52 |c_main_~#sum~0.base| (store .cse53 |c_main_~#sum~0.offset| (+ .cse49 .cse50 .cse51))))) (let ((.cse44 (let ((.cse46 (let ((.cse47 (let ((.cse48 (select .cse45 c_main_~a~0.base))) (store .cse48 c_main_~a~0.offset (+ .cse49 .cse50 .cse51 (select .cse48 c_main_~a~0.offset)))))) (store .cse47 .cse1 (+ (select .cse47 .cse1) (select (select (store .cse45 c_main_~a~0.base .cse47) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse46 c_main_~a~0.offset (mod (select .cse46 c_main_~a~0.offset) (+ (select (select (store .cse45 c_main_~a~0.base .cse46) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse43 (mod (select .cse44 .cse1) (+ (select (select (store .cse45 c_main_~a~0.base .cse44) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= 0 .cse43) (not (= (select (store .cse44 .cse1 .cse43) c_main_~a~0.offset) 0))))))))))) (let ((.cse61 (select .cse42 .cse14))) (let ((.cse57 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse35 .cse24 .cse61))))) (let ((.cse55 (let ((.cse58 (let ((.cse59 (let ((.cse60 (select .cse57 c_main_~a~0.base))) (store .cse60 c_main_~a~0.offset (+ .cse35 (select .cse60 c_main_~a~0.offset) .cse24 .cse61))))) (store .cse59 .cse1 (+ (select .cse59 .cse1) (select (select (store .cse57 c_main_~a~0.base .cse59) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse58 c_main_~a~0.offset (mod (select .cse58 c_main_~a~0.offset) (+ (select (select (store .cse57 c_main_~a~0.base .cse58) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse56 (mod (select .cse55 .cse1) (+ (select (select (store .cse57 c_main_~a~0.base .cse55) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse55 .cse1 .cse56) c_main_~a~0.offset) 0)) (= .cse56 0)))))) (let ((.cse68 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| .cse21)) c_main_~a~0.base) .cse1))) (let ((.cse64 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| (+ .cse15 .cse35 .cse68))))) (let ((.cse63 (let ((.cse65 (let ((.cse66 (let ((.cse67 (select .cse64 c_main_~a~0.base))) (store .cse67 c_main_~a~0.offset (+ .cse15 .cse35 (select .cse67 c_main_~a~0.offset) .cse68))))) (store .cse66 .cse1 (+ (select (select (store .cse64 c_main_~a~0.base .cse66) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse66 .cse1)))))) (store .cse65 c_main_~a~0.offset (mod (select .cse65 c_main_~a~0.offset) (+ (select (select (store .cse64 c_main_~a~0.base .cse65) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse62 (mod (select .cse63 .cse1) (+ (select (select (store .cse64 c_main_~a~0.base .cse63) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse62 0) (not (= 0 (select (store .cse63 .cse1 .cse62) c_main_~a~0.offset)))))))) (let ((.cse78 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse79 (select .cse78 |c_main_~#sum~0.base|))) (let ((.cse76 (select .cse13 c_main_~a~0.offset)) (.cse77 (select .cse79 |c_main_~#sum~0.offset|))) (let ((.cse75 (select (select (store .cse78 |c_main_~#sum~0.base| (store .cse79 |c_main_~#sum~0.offset| (+ .cse76 .cse77))) c_main_~a~0.base) .cse1))) (let ((.cse71 (store .cse78 |c_main_~#sum~0.base| (store .cse79 |c_main_~#sum~0.offset| (+ .cse75 .cse76 .cse77))))) (let ((.cse70 (let ((.cse72 (let ((.cse73 (let ((.cse74 (select .cse71 c_main_~a~0.base))) (store .cse74 c_main_~a~0.offset (+ .cse75 .cse76 (select .cse74 c_main_~a~0.offset) .cse77))))) (store .cse73 .cse1 (+ (select .cse73 .cse1) (select (select (store .cse71 c_main_~a~0.base .cse73) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse72 c_main_~a~0.offset (mod (select .cse72 c_main_~a~0.offset) (+ (select (select (store .cse71 c_main_~a~0.base .cse72) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse69 (mod (select .cse70 .cse1) (+ (select (select (store .cse71 c_main_~a~0.base .cse70) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse69 0) (not (= (select (store .cse70 .cse1 .cse69) c_main_~a~0.offset) 0)))))))))))))))) is different from true [2022-01-31 01:23:42,938 WARN L228 SmtUtils]: Spent 16.69s on a formula simplification. DAG size of input: 233 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:23:45,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:24:36,769 WARN L228 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 01:24:39,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:24:57,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:25:02,394 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse51 (* c_main_~i~0 8))) (let ((.cse23 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse21 (select |c_#memory_int| c_main_~a~0.base)) (.cse22 (+ c_main_~a~0.offset .cse51))) (let ((.cse52 (select .cse21 .cse22)) (.cse39 (+ .cse23 1))) (let ((.cse24 (mod .cse52 .cse39))) (let ((.cse15 (store .cse21 .cse22 .cse24)) (.cse16 (< .cse52 0)) (.cse17 (= .cse24 0)) (.cse14 (+ c_main_~a~0.offset .cse51 8)) (.cse1 (+ c_main_~a~0.offset 8)) (.cse13 (store .cse21 .cse22 1))) (and (let ((.cse12 (store .cse13 .cse14 1))) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base .cse12))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse11 |c_main_~#sum~0.offset|)) (.cse8 (select .cse12 c_main_~a~0.offset))) (let ((.cse9 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8))) c_main_~a~0.base) .cse1))) (let ((.cse3 (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse7 .cse8 .cse9))))) (let ((.cse0 (let ((.cse4 (let ((.cse5 (let ((.cse6 (select .cse3 c_main_~a~0.base))) (store .cse6 c_main_~a~0.offset (+ .cse7 .cse8 .cse9 (select .cse6 c_main_~a~0.offset)))))) (store .cse5 .cse1 (+ (select (select (store .cse3 c_main_~a~0.base .cse5) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse5 .cse1)))))) (store .cse4 c_main_~a~0.offset (mod (select .cse4 c_main_~a~0.offset) (+ (select (select (store .cse3 c_main_~a~0.base .cse4) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse2 (mod (select .cse0 .cse1) (+ (select (select (store .cse3 c_main_~a~0.base .cse0) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (not (= (select (store .cse0 .cse1 .cse2) c_main_~a~0.offset) 0)) (= .cse2 0)))))))))) (or (not (= (select .cse15 c_main_~a~0.offset) 0)) (= (select .cse15 .cse1) 0)) (let ((.cse18 (store .cse15 .cse14 (mod (select .cse15 .cse14) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse15) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1))))) (or (and .cse16 (not .cse17)) (not (= (select .cse18 c_main_~a~0.offset) 0)) (= (select .cse18 .cse1) 0))) (let ((.cse19 (let ((.cse20 (store .cse21 .cse22 (+ .cse23 .cse24 1)))) (store .cse20 .cse14 (mod (select .cse20 .cse14) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse20) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (or (not .cse16) (= (select .cse19 .cse1) 0) .cse17 (not (= 0 (select .cse19 c_main_~a~0.offset))))) (= c_main_~a~0.offset 0) (let ((.cse36 (store .cse21 .cse14 1))) (let ((.cse34 (store |c_#memory_int| c_main_~a~0.base .cse36))) (let ((.cse35 (select .cse34 |c_main_~#sum~0.base|))) (let ((.cse31 (select .cse36 c_main_~a~0.offset)) (.cse32 (select .cse35 |c_main_~#sum~0.offset|))) (let ((.cse33 (select (select (store .cse34 |c_main_~#sum~0.base| (store .cse35 |c_main_~#sum~0.offset| (+ .cse31 .cse32))) c_main_~a~0.base) .cse1))) (let ((.cse27 (store .cse34 |c_main_~#sum~0.base| (store .cse35 |c_main_~#sum~0.offset| (+ .cse31 .cse32 .cse33))))) (let ((.cse26 (let ((.cse28 (let ((.cse29 (let ((.cse30 (select .cse27 c_main_~a~0.base))) (store .cse30 c_main_~a~0.offset (+ .cse31 .cse32 .cse33 (select .cse30 c_main_~a~0.offset)))))) (store .cse29 .cse1 (+ (select .cse29 .cse1) (select (select (store .cse27 c_main_~a~0.base .cse29) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse28 c_main_~a~0.offset (mod (select .cse28 c_main_~a~0.offset) (+ (select (select (store .cse27 c_main_~a~0.base .cse28) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse25 (mod (select .cse26 .cse1) (+ (select (select (store .cse27 c_main_~a~0.base .cse26) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= 0 .cse25) (not (= (select (store .cse26 .cse1 .cse25) c_main_~a~0.offset) 0))))))))))) (exists ((|main_~#sum~0.offset| Int) (|main_~#sum~0.base| Int)) (let ((.cse37 (select (select |c_#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|))) (and (= .cse37 2) (not (= c_main_~a~0.base |main_~#sum~0.base|)) (= (mod 3 (+ .cse37 1)) (select (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset 8)))))) (let ((.cse38 (store .cse21 .cse14 (mod (select .cse21 .cse14) .cse39)))) (or (not (= (select .cse38 c_main_~a~0.offset) 0)) (= (select .cse38 .cse1) 0))) (= (select .cse21 c_main_~a~0.offset) 0) (let ((.cse49 (store |c_#memory_int| c_main_~a~0.base .cse13))) (let ((.cse50 (select .cse49 |c_main_~#sum~0.base|))) (let ((.cse47 (select .cse13 c_main_~a~0.offset)) (.cse48 (select .cse50 |c_main_~#sum~0.offset|))) (let ((.cse46 (select (select (store .cse49 |c_main_~#sum~0.base| (store .cse50 |c_main_~#sum~0.offset| (+ .cse47 .cse48))) c_main_~a~0.base) .cse1))) (let ((.cse42 (store .cse49 |c_main_~#sum~0.base| (store .cse50 |c_main_~#sum~0.offset| (+ .cse46 .cse47 .cse48))))) (let ((.cse41 (let ((.cse43 (let ((.cse44 (let ((.cse45 (select .cse42 c_main_~a~0.base))) (store .cse45 c_main_~a~0.offset (+ .cse46 .cse47 (select .cse45 c_main_~a~0.offset) .cse48))))) (store .cse44 .cse1 (+ (select .cse44 .cse1) (select (select (store .cse42 c_main_~a~0.base .cse44) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))) (store .cse43 c_main_~a~0.offset (mod (select .cse43 c_main_~a~0.offset) (+ (select (select (store .cse42 c_main_~a~0.base .cse43) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))))) (let ((.cse40 (mod (select .cse41 .cse1) (+ (select (select (store .cse42 c_main_~a~0.base .cse41) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) 1)))) (or (= .cse40 0) (not (= (select (store .cse41 .cse1 .cse40) c_main_~a~0.offset) 0)))))))))))))))) is different from true [2022-01-31 01:25:13,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-31 01:25:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 01:25:15,608 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-01-31 01:25:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-01-31 01:25:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.608695652173913) internal successors, (74), 47 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2022-01-31 01:25:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 01:25:15,609 INFO L225 Difference]: With dead ends: 103 [2022-01-31 01:25:15,609 INFO L226 Difference]: Without dead ends: 70 [2022-01-31 01:25:15,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 180.0s TimeCoverageRelationStatistics Valid=636, Invalid=3389, Unknown=15, NotChecked=250, Total=4290 [2022-01-31 01:25:15,612 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 88 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 251 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2022-01-31 01:25:15,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 498 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 400 Invalid, 3 Unknown, 122 Unchecked, 31.4s Time] [2022-01-31 01:25:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-31 01:25:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2022-01-31 01:25:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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:25:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-01-31 01:25:15,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2022-01-31 01:25:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 01:25:15,621 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-01-31 01:25:15,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.608695652173913) internal successors, (74), 47 states have internal predecessors, (74), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 01:25:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-01-31 01:25:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 01:25:15,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 01:25:15,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 01:25:15,646 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:25:15,838 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:25:15,839 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 01:25:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 01:25:15,839 INFO L85 PathProgramCache]: Analyzing trace with hash 268946907, now seen corresponding path program 7 times [2022-01-31 01:25:15,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 01:25:15,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040673100] [2022-01-31 01:25:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 01:25:15,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 01:25:15,861 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-31 01:25:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946426086] [2022-01-31 01:25:15,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-31 01:25:15,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 01:25:15,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 01:25:15,875 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:25:15,877 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:25:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 01:25:15,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 87 conjunts are in the unsatisfiable core [2022-01-31 01:25:15,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 01:25:15,997 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:25:16,005 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:25:16,032 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 23 treesize of output 22 [2022-01-31 01:25:16,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,084 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 35 treesize of output 37 [2022-01-31 01:25:16,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,143 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 37 treesize of output 42 [2022-01-31 01:25:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:16,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-01-31 01:25:16,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:16,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2022-01-31 01:25:16,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2022-01-31 01:25:16,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:16,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 56 [2022-01-31 01:25:16,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:16,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 58 [2022-01-31 01:25:16,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 55 [2022-01-31 01:25:16,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:16,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:16,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 119 [2022-01-31 01:25:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:17,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:17,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:17,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:17,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-31 01:25:17,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-01-31 01:25:17,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-31 01:25:17,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-01-31 01:25:17,389 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 22 treesize of output 10 [2022-01-31 01:25:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 01:25:17,521 INFO L328 TraceCheckSpWp]: Computing backward predicates...