./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:08:19,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:08:19,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:08:19,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:08:19,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:08:19,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:08:19,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:08:19,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:08:19,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:08:19,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:08:19,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:08:19,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:08:19,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:08:19,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:08:19,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:08:19,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:08:19,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:08:19,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:08:19,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:08:19,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:08:19,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:08:19,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:08:19,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:08:19,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:08:19,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:08:19,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:08:19,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:08:19,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:08:19,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:08:19,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:08:19,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:08:19,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:08:19,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:08:19,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:08:19,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:08:19,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:08:19,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:08:19,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:08:19,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:08:19,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:08:19,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:08:19,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:08:19,993 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:08:19,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:08:19,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:08:19,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:08:19,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:08:19,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:08:19,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:08:19,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:08:19,996 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:08:19,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:08:19,997 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:08:19,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:08:19,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:08:19,999 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:08:19,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:08:19,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:08:19,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:08:19,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:08:19,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:08:20,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:08:20,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:08:20,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:08:20,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:08:20,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:08:20,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:08:20,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:08:20,001 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:08:20,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:08:20,002 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:08:20,002 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 105e7597bd9cfde6146cefe87563ba1bc48309677fb8b2f1d1f421bc92453e6b [2023-02-15 10:08:20,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:08:20,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:08:20,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:08:20,267 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:08:20,267 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:08:20,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2.c [2023-02-15 10:08:21,403 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:08:21,590 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:08:21,590 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c [2023-02-15 10:08:21,599 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b95a20f/85a70552ad0a47578e673c77ec4d9353/FLAG7ee9b7375 [2023-02-15 10:08:21,616 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b95a20f/85a70552ad0a47578e673c77ec4d9353 [2023-02-15 10:08:21,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:08:21,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:08:21,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:08:21,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:08:21,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:08:21,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367f64a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21, skipping insertion in model container [2023-02-15 10:08:21,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:08:21,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:08:21,777 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-02-15 10:08:21,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:08:21,801 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:08:21,810 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-02-15 10:08:21,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:08:21,830 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:08:21,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21 WrapperNode [2023-02-15 10:08:21,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:08:21,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:08:21,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:08:21,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:08:21,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,864 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2023-02-15 10:08:21,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:08:21,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:08:21,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:08:21,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:08:21,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,887 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:08:21,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:08:21,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:08:21,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:08:21,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (1/1) ... [2023-02-15 10:08:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:08:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:21,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:08:21,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:08:21,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:08:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:08:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:08:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:08:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:08:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:08:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:08:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:08:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:08:22,057 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:08:22,059 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:08:22,323 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:08:22,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:08:22,329 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-02-15 10:08:22,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:22 BoogieIcfgContainer [2023-02-15 10:08:22,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:08:22,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:08:22,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:08:22,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:08:22,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:08:21" (1/3) ... [2023-02-15 10:08:22,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a16876d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:22, skipping insertion in model container [2023-02-15 10:08:22,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:21" (2/3) ... [2023-02-15 10:08:22,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a16876d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:22, skipping insertion in model container [2023-02-15 10:08:22,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:22" (3/3) ... [2023-02-15 10:08:22,338 INFO L112 eAbstractionObserver]: Analyzing ICFG res2.c [2023-02-15 10:08:22,352 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:08:22,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:08:22,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:08:22,405 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51589434, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:08:22,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:08:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:08:22,429 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:22,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:22,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1780399656, now seen corresponding path program 1 times [2023-02-15 10:08:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:22,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073495942] [2023-02-15 10:08:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:22,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073495942] [2023-02-15 10:08:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073495942] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:08:22,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:08:22,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:08:22,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773210919] [2023-02-15 10:08:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:08:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:08:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:08:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:08:22,684 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:22,699 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2023-02-15 10:08:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:08:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:08:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:22,712 INFO L225 Difference]: With dead ends: 56 [2023-02-15 10:08:22,712 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 10:08:22,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:08:22,721 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:22,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:08:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 10:08:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-15 10:08:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-15 10:08:22,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2023-02-15 10:08:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:22,761 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-15 10:08:22,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-15 10:08:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 10:08:22,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:22,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:22,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:08:22,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1279549768, now seen corresponding path program 1 times [2023-02-15 10:08:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:22,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270622115] [2023-02-15 10:08:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270622115] [2023-02-15 10:08:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270622115] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:08:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:08:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:08:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396526546] [2023-02-15 10:08:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:08:22,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:08:22,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:08:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:08:22,980 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:23,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:23,071 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-02-15 10:08:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:08:23,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 10:08:23,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:23,073 INFO L225 Difference]: With dead ends: 57 [2023-02-15 10:08:23,073 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:08:23,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:08:23,074 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:23,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 14 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:08:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:08:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-15 10:08:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-02-15 10:08:23,081 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 19 [2023-02-15 10:08:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:23,081 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-02-15 10:08:23,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-02-15 10:08:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:08:23,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:23,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:23,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:08:23,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1740145276, now seen corresponding path program 1 times [2023-02-15 10:08:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190556178] [2023-02-15 10:08:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190556178] [2023-02-15 10:08:24,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190556178] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:08:24,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432325816] [2023-02-15 10:08:24,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:24,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:24,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:24,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:08:24,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:08:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:25,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 10:08:25,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:08:25,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:08:25,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:08:25,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 10:08:25,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-02-15 10:08:25,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:25,603 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:08:25,604 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 10:08:25,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:25,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-02-15 10:08:25,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:25,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:25,943 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 10:08:25,944 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 10:08:26,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:26,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-02-15 10:08:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:26,160 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 12 [2023-02-15 10:08:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:26,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:08:53,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:53,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:53,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:53,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432325816] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:53,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:08:53,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 41 [2023-02-15 10:08:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222679230] [2023-02-15 10:08:53,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:53,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 10:08:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:53,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 10:08:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1360, Unknown=9, NotChecked=0, Total=1640 [2023-02-15 10:08:53,076 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:54,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:54,757 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-02-15 10:08:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:08:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 10:08:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:54,760 INFO L225 Difference]: With dead ends: 57 [2023-02-15 10:08:54,760 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:08:54,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=462, Invalid=2285, Unknown=9, NotChecked=0, Total=2756 [2023-02-15 10:08:54,762 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:54,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 123 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:08:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:08:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-02-15 10:08:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-15 10:08:54,781 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 31 [2023-02-15 10:08:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:54,781 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-15 10:08:54,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 41 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-15 10:08:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:08:54,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:54,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:54,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:08:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:54,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1839245574, now seen corresponding path program 2 times [2023-02-15 10:08:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876895623] [2023-02-15 10:08:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:54,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:08:55,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:55,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876895623] [2023-02-15 10:08:55,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876895623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:08:55,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741364271] [2023-02-15 10:08:55,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:08:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:55,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:08:55,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:08:55,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:08:55,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:08:55,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:08:55,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:08:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:08:55,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:08:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:08:55,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741364271] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:55,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:08:55,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:08:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453152979] [2023-02-15 10:08:55,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:55,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:08:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:55,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:08:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:08:55,370 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:55,615 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2023-02-15 10:08:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:08:55,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 10:08:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:55,617 INFO L225 Difference]: With dead ends: 128 [2023-02-15 10:08:55,617 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 10:08:55,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:08:55,618 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:55,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 33 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:08:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 10:08:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2023-02-15 10:08:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-02-15 10:08:55,627 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 33 [2023-02-15 10:08:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:55,627 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-02-15 10:08:55,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-02-15 10:08:55,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 10:08:55,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:55,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:55,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:08:55,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 10:08:55,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 447877832, now seen corresponding path program 3 times [2023-02-15 10:08:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716539580] [2023-02-15 10:08:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:08:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:55,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716539580] [2023-02-15 10:08:55,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716539580] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:08:55,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306022421] [2023-02-15 10:08:55,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:08:55,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:55,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:08:55,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:08:56,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:08:56,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:08:56,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:08:56,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:08:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:08:56,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:08:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:08:56,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306022421] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:56,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:08:56,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:08:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96662442] [2023-02-15 10:08:56,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:56,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:08:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:08:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:08:56,146 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:56,331 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2023-02-15 10:08:56,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:08:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 10:08:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:56,333 INFO L225 Difference]: With dead ends: 65 [2023-02-15 10:08:56,333 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 10:08:56,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:08:56,334 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:56,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 29 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:08:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 10:08:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-02-15 10:08:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2023-02-15 10:08:56,340 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 35 [2023-02-15 10:08:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:56,341 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2023-02-15 10:08:56,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2023-02-15 10:08:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 10:08:56,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:56,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:56,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:08:56,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:56,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:56,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1410382416, now seen corresponding path program 4 times [2023-02-15 10:08:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:56,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436094938] [2023-02-15 10:08:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:00,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436094938] [2023-02-15 10:09:00,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436094938] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:00,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778667632] [2023-02-15 10:09:00,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:09:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:00,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:00,146 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:00,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:09:00,248 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:09:00,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:09:00,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 10:09:00,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:00,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:09:00,295 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:09:00,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 10:09:00,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:09:00,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:09:00,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:00,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:00,879 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2023-02-15 10:09:01,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:01,058 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2023-02-15 10:09:01,473 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 44 [2023-02-15 10:09:01,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:01,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2023-02-15 10:09:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:01,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:01,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2023-02-15 10:09:02,222 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2023-02-15 10:09:02,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:02,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:02,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:02,572 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 10:09:02,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 74 [2023-02-15 10:09:03,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:03,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:03,252 INFO L321 Elim1Store]: treesize reduction 132, result has 30.5 percent of original size [2023-02-15 10:09:03,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 143 treesize of output 163 [2023-02-15 10:09:04,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:04,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:04,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:04,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-02-15 10:09:05,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:05,090 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2023-02-15 10:09:05,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:05,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 24 [2023-02-15 10:09:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:05,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:10:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:10:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778667632] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:10:59,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:10:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 31] total 90 [2023-02-15 10:10:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891451306] [2023-02-15 10:10:59,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:10:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-02-15 10:10:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:10:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-02-15 10:10:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=919, Invalid=7050, Unknown=41, NotChecked=0, Total=8010 [2023-02-15 10:10:59,377 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 90 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:11:33,404 WARN L233 SmtUtils]: Spent 31.48s on a formula simplification. DAG size of input: 277 DAG size of output: 275 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:11:35,761 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse67 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse41 (* c_~N~0 3)) (.cse34 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse51 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (+ .cse34 (select .cse24 .cse51))) (.cse12 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse13 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse21 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse32 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse7 (+ .cse41 1)) (.cse25 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~c~0#1.offset| 4)) (.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_327 Int) (v_ArrVal_325 Int)) (let ((.cse1 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse10 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (let ((.cse9 (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_323 1)) (< (+ v_ArrVal_334 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_320 .cse8)) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_329 1)))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or .cse12 .cse13 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_317 Int) (v_ArrVal_327 Int) (v_ArrVal_315 Int) (v_ArrVal_325 Int)) (let ((.cse18 (store .cse24 .cse25 v_ArrVal_315))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (let ((.cse23 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (let ((.cse22 (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse22 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse14 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_317 (+ (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_315 1)) (not (<= v_ArrVal_323 1)) (not (<= v_ArrVal_322 1)) (< (+ v_ArrVal_334 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) 7) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_320 (+ v_ArrVal_317 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (not (<= v_ArrVal_329 1)))))))))))) (or (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_317 Int) (v_ArrVal_327 Int) (v_ArrVal_325 Int)) (let ((.cse26 (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse31 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (let ((.cse30 (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse30 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_320 (+ v_ArrVal_317 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25)))) (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_323 1)) (< (+ v_ArrVal_334 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_317 .cse8)) (not (<= v_ArrVal_329 1)))))))) .cse32 .cse33) (or (< 2 c_~N~0) (not (< 1 c_~N~0)) (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_317 Int) (v_ArrVal_327 Int) (v_ArrVal_325 Int)) (let ((.cse35 (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse40 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse40 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse38 (let ((.cse39 (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse39 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse39 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_317 (+ .cse34 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_323 1)) (< (+ v_ArrVal_334 (select (select (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_320 (+ v_ArrVal_317 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_329 1))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ .cse34 4) .cse41) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (or .cse12 (forall ((v_ArrVal_313 Int) (v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_317 Int) (v_ArrVal_327 Int) (v_ArrVal_315 Int) (v_ArrVal_325 Int)) (let ((.cse47 (store (store .cse24 .cse51 v_ArrVal_313) .cse25 v_ArrVal_315))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (let ((.cse50 (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (let ((.cse49 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse49 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse49 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (< (+ v_ArrVal_334 (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) 7) (not (<= v_ArrVal_317 (+ (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_315 1)) (not (<= v_ArrVal_323 1)) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_320 (+ v_ArrVal_317 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (not (<= v_ArrVal_313 1)) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_325 (+ (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|) v_ArrVal_322))) (not (<= v_ArrVal_329 1))))))))))) .cse13) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_317 Int) (v_ArrVal_327 Int) (v_ArrVal_315 Int) (v_ArrVal_325 Int)) (let ((.cse53 (store .cse24 .cse51 v_ArrVal_315))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (let ((.cse60 (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse60 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse60 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse58 (let ((.cse59 (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse59 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse59 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse55 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_317 (+ (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_320 (+ v_ArrVal_317 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_317)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21)))) (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (< (+ v_ArrVal_334 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) 7) (not (<= v_ArrVal_315 1)) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse57 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_323 1)) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_329 1)))))))))))) (or .cse32 (forall ((v_ArrVal_323 Int) (v_ArrVal_334 Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (v_ArrVal_331 Int) (v_ArrVal_329 Int) (v_ArrVal_327 Int) (v_ArrVal_325 Int)) (let ((.cse61 (let ((.cse66 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_320)))) (store .cse66 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse66 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_322) .cse3 v_ArrVal_323))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (let ((.cse65 (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_327)))) (store .cse65 |c_ULTIMATE.start_main_~c~0#1.base| (store (store (select .cse65 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_329) .cse6 v_ArrVal_331))))) (let ((.cse63 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_327 (+ v_ArrVal_325 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_325)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3)))) (not (<= v_ArrVal_334 (+ v_ArrVal_329 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_325 (+ v_ArrVal_322 (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_323 1)) (< (+ v_ArrVal_334 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_334)) |c_ULTIMATE.start_main_~c~0#1.base|) .cse6)) .cse7) (not (<= v_ArrVal_322 1)) (not (<= v_ArrVal_320 (+ .cse34 (select .cse24 .cse25)))) (not (<= v_ArrVal_331 1)) (not (<= v_ArrVal_329 1)))))))) .cse33))))) is different from true [2023-02-15 10:11:37,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:39,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:41,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:43,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:59,413 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:12:30,066 WARN L233 SmtUtils]: Spent 27.24s on a formula simplification that was a NOOP. DAG size: 306 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:12:32,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:12:34,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:12:36,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:12:38,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:12:40,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:12:50,432 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)