./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/mods.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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:24:52,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:24:52,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:24:52,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:24:52,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:24:52,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:24:52,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:24:52,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:24:52,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:24:52,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:24:52,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:24:52,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:24:52,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:24:52,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:24:52,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:24:52,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:24:52,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:24:52,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:24:52,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:24:52,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:24:52,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:24:52,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:24:52,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:24:52,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:24:53,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:24:53,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:24:53,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:24:53,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:24:53,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:24:53,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:24:53,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:24:53,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:24:53,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:24:53,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:24:53,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:24:53,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:24:53,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:24:53,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:24:53,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:24:53,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:24:53,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:24:53,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:24:53,048 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:24:53,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:24:53,049 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:24:53,049 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:24:53,050 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:24:53,050 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:24:53,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:24:53,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:24:53,051 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:24:53,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:24:53,052 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:24:53,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:24:53,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:24:53,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:24:53,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:24:53,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:24:53,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:24:53,054 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:24:53,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:24:53,054 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:24:53,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:24:53,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:24:53,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:24:53,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:24:53,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:24:53,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:24:53,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:24:53,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:24:53,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:24:53,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:24:53,057 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:24:53,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:24:53,057 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:24:53,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:24:53,057 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:24:53,058 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2023-02-16 00:24:53,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:24:53,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:24:53,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:24:53,313 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:24:53,316 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:24:53,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2023-02-16 00:24:54,444 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:24:54,627 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:24:54,628 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2023-02-16 00:24:54,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b39b310/19af4b1c4b7140d7aa9065d540941500/FLAG24d7311e0 [2023-02-16 00:24:54,654 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b39b310/19af4b1c4b7140d7aa9065d540941500 [2023-02-16 00:24:54,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:24:54,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:24:54,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:24:54,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:24:54,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:24:54,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d14ce59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54, skipping insertion in model container [2023-02-16 00:24:54,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:24:54,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:24:54,842 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/mods.c[587,600] [2023-02-16 00:24:54,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:24:54,874 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:24:54,887 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/mods.c[587,600] [2023-02-16 00:24:54,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:24:54,904 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:24:54,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54 WrapperNode [2023-02-16 00:24:54,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:24:54,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:24:54,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:24:54,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:24:54,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,939 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-02-16 00:24:54,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:24:54,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:24:54,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:24:54,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:24:54,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:24:54,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:24:54,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:24:54,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:24:54,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (1/1) ... [2023-02-16 00:24:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:24:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:24:55,002 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-16 00:24:55,008 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-16 00:24:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:24:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:24:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:24:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:24:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:24:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:24:55,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:24:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:24:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:24:55,104 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:24:55,107 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:24:55,311 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:24:55,316 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:24:55,317 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 00:24:55,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:24:55 BoogieIcfgContainer [2023-02-16 00:24:55,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:24:55,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:24:55,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:24:55,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:24:55,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:24:54" (1/3) ... [2023-02-16 00:24:55,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b680fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:24:55, skipping insertion in model container [2023-02-16 00:24:55,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:24:54" (2/3) ... [2023-02-16 00:24:55,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b680fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:24:55, skipping insertion in model container [2023-02-16 00:24:55,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:24:55" (3/3) ... [2023-02-16 00:24:55,326 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2023-02-16 00:24:55,342 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:24:55,342 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:24:55,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:24:55,390 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;@351bdc1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:24:55,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:24:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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-16 00:24:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:24:55,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:24:55,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:24:55,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:24:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:24:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-02-16 00:24:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:24:55,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191988550] [2023-02-16 00:24:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:24:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:24:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:24:55,578 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-16 00:24:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:24:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191988550] [2023-02-16 00:24:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191988550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:24:55,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:24:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:24:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961630167] [2023-02-16 00:24:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:24:55,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:24:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:24:55,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:24:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:24:55,627 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-16 00:24:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:24:55,649 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-16 00:24:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:24:55,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2023-02-16 00:24:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:24:55,657 INFO L225 Difference]: With dead ends: 50 [2023-02-16 00:24:55,658 INFO L226 Difference]: Without dead ends: 23 [2023-02-16 00:24:55,660 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-16 00:24:55,663 INFO L413 NwaCegarLoop]: 32 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, 32 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-16 00:24:55,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:24:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-16 00:24:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-16 00:24:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-16 00:24:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-16 00:24:55,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-02-16 00:24:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:24:55,684 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-16 00:24:55,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-16 00:24:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-16 00:24:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:24:55,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:24:55,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:24:55,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:24:55,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:24:55,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:24:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-02-16 00:24:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:24:55,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194894566] [2023-02-16 00:24:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:24:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:24:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:24:55,888 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-16 00:24:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:24:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194894566] [2023-02-16 00:24:55,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194894566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:24:55,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:24:55,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:24:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15255172] [2023-02-16 00:24:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:24:55,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:24:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:24:55,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:24:55,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:24:55,892 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 00:24:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:24:55,952 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-02-16 00:24:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:24:55,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2023-02-16 00:24:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:24:55,953 INFO L225 Difference]: With dead ends: 53 [2023-02-16 00:24:55,953 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:24:55,954 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-16 00:24:55,955 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:24:55,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:24:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:24:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-02-16 00:24:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-16 00:24:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-16 00:24:55,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-02-16 00:24:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:24:55,963 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-16 00:24:55,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 00:24:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-16 00:24:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:24:55,964 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:24:55,964 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] [2023-02-16 00:24:55,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:24:55,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:24:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:24:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-02-16 00:24:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:24:55,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620290410] [2023-02-16 00:24:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:24:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:24:55,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:24:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976994364] [2023-02-16 00:24:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:24:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:24:55,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:24:56,003 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-16 00:24:56,006 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-16 00:24:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:24:56,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 00:24:56,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:24:56,184 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-16 00:24:56,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:24:56,221 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-16 00:24:56,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:24:56,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-02-16 00:24:56,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:24:56,435 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 40 treesize of output 23 [2023-02-16 00:24:56,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:24:56,545 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 228 treesize of output 123 [2023-02-16 00:24:56,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:24:56,822 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 53 treesize of output 29 [2023-02-16 00:24:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:24:56,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:24:59,181 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_49 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_49)) (= 0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_49)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ v_ArrVal_49 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))) is different from false [2023-02-16 00:25:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 00:25:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:25:18,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620290410] [2023-02-16 00:25:18,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:25:18,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976994364] [2023-02-16 00:25:18,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976994364] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:25:18,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:25:18,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-02-16 00:25:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024133733] [2023-02-16 00:25:18,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:25:18,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 00:25:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:25:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 00:25:18,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=342, Unknown=8, NotChecked=38, Total=462 [2023-02-16 00:25:18,338 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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-16 00:25:34,082 WARN L233 SmtUtils]: Spent 12.91s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:25:36,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:25:38,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:25:40,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:25:42,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:25:58,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:25:58,929 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2023-02-16 00:25:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 00:25:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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 24 [2023-02-16 00:25:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:25:58,931 INFO L225 Difference]: With dead ends: 80 [2023-02-16 00:25:58,931 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 00:25:58,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=233, Invalid=1092, Unknown=11, NotChecked=70, Total=1406 [2023-02-16 00:25:58,933 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 31 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-02-16 00:25:58,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 172 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 284 Invalid, 3 Unknown, 52 Unchecked, 8.8s Time] [2023-02-16 00:25:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 00:25:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 44. [2023-02-16 00:25:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 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-16 00:25:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2023-02-16 00:25:58,944 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 24 [2023-02-16 00:25:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:25:58,944 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2023-02-16 00:25:58,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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-16 00:25:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2023-02-16 00:25:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:25:58,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:25:58,946 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] [2023-02-16 00:25:58,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:25:59,152 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-16 00:25:59,152 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:25:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:25:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 775449632, now seen corresponding path program 2 times [2023-02-16 00:25:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:25:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048493114] [2023-02-16 00:25:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:25:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:25:59,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:25:59,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932524948] [2023-02-16 00:25:59,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:25:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:25:59,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:25:59,184 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-16 00:25:59,188 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-16 00:25:59,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:25:59,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:25:59,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:25:59,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:25:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:25:59,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:25:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:25:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:25:59,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048493114] [2023-02-16 00:25:59,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:25:59,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932524948] [2023-02-16 00:25:59,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932524948] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:25:59,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:25:59,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:25:59,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280200321] [2023-02-16 00:25:59,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:25:59,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:25:59,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:25:59,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:25:59,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:25:59,330 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-16 00:25:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:25:59,524 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2023-02-16 00:25:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:25:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 26 [2023-02-16 00:25:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:25:59,525 INFO L225 Difference]: With dead ends: 108 [2023-02-16 00:25:59,525 INFO L226 Difference]: Without dead ends: 80 [2023-02-16 00:25:59,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:25:59,527 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 83 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:25:59,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 59 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:25:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-16 00:25:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2023-02-16 00:25:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 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-16 00:25:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2023-02-16 00:25:59,537 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 26 [2023-02-16 00:25:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:25:59,538 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2023-02-16 00:25:59,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-16 00:25:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2023-02-16 00:25:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 00:25:59,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:25:59,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:25:59,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 00:25:59,745 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-16 00:25:59,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:25:59,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:25:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1411307230, now seen corresponding path program 3 times [2023-02-16 00:25:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:25:59,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500135317] [2023-02-16 00:25:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:25:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:25:59,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:25:59,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568988297] [2023-02-16 00:25:59,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:25:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:25:59,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:25:59,764 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-16 00:25:59,784 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-16 00:25:59,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 00:25:59,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:25:59,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:25:59,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:25:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:25:59,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:25:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:25:59,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:25:59,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500135317] [2023-02-16 00:25:59,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:25:59,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568988297] [2023-02-16 00:25:59,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568988297] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:25:59,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:25:59,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-16 00:25:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139681446] [2023-02-16 00:25:59,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:25:59,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 00:25:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:25:59,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 00:25:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:25:59,956 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 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-16 00:26:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:26:00,101 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2023-02-16 00:26:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:26:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 28 [2023-02-16 00:26:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:26:00,103 INFO L225 Difference]: With dead ends: 101 [2023-02-16 00:26:00,103 INFO L226 Difference]: Without dead ends: 51 [2023-02-16 00:26:00,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:26:00,104 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:26:00,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 42 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:26:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-16 00:26:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2023-02-16 00:26:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-16 00:26:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-16 00:26:00,114 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2023-02-16 00:26:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:26:00,115 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-16 00:26:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-16 00:26:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-16 00:26:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:26:00,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:26:00,117 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:26:00,123 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-16 00:26:00,323 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-16 00:26:00,324 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:26:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:26:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2023-02-16 00:26:00,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:26:00,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913213441] [2023-02-16 00:26:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:26:00,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:26:00,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 00:26:00,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000054085] [2023-02-16 00:26:00,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:26:00,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:26:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:26:00,347 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-16 00:26:00,349 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-16 00:26:00,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:26:00,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:26:00,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 00:26:00,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:26:00,454 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-16 00:26:00,458 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-16 00:26:00,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-16 00:26:00,518 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 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-16 00:26:00,696 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-16 00:26:00,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2023-02-16 00:26:00,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:26:00,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:00,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:00,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2023-02-16 00:26:01,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:26:01,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:01,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 44 [2023-02-16 00:26:01,145 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:01,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 46 [2023-02-16 00:26:01,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:26:01,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:01,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 146 [2023-02-16 00:26:01,450 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:01,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-02-16 00:26:01,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:26:01,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-16 00:26:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:26:01,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:26:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:26:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:26:07,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913213441] [2023-02-16 00:26:07,808 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 00:26:07,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000054085] [2023-02-16 00:26:07,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000054085] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:26:07,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:26:07,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-16 00:26:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552976391] [2023-02-16 00:26:07,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:26:07,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-16 00:26:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:26:07,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-16 00:26:07,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2023-02-16 00:26:07,811 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 46 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-16 00:26:18,564 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:26:24,705 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse39 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse38 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse39)) (.cse3 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (store .cse1 .cse38 (+ (select .cse1 .cse38) .cse3))) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse39 8)) (.cse12 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (+ .cse3 .cse12)) (.cse4 (select .cse1 .cse2)) (.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse28 (store .cse1 .cse38 1))) (and (= 0 (let ((.cse0 (store .cse1 .cse2 (+ .cse3 .cse4)))) (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (= 0 (mod .cse5 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| .cse5))) (store .cse6 .cse7 (+ (select .cse1 .cse7) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (or (not (< 1 c_~N~0)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< 2 c_~N~0) (= 0 (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse12 .cse13))))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (+ .cse3 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12 .cse13))) (mod .cse8 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (store .cse10 .cse7 (+ (select .cse11 .cse7) (select (select (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))) (= 0 (let ((.cse15 (store .cse16 .cse2 (+ .cse4 .cse17)))) (mod (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (< 0 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (let ((.cse27 (store .cse28 .cse2 1))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse19 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23 .cse24))))) (let ((.cse21 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (+ .cse22 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse23 .cse24))) (mod .cse18 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| .cse18))) (store .cse20 .cse7 (+ (select .cse21 .cse7) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))))) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (= 0 (mod (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse17 1))) (or (= 0 (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse30 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))))) (let ((.cse32 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse29 (+ .cse33 .cse34 .cse35 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse29 (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29))) (store .cse31 .cse7 (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse32 .cse7))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (= 0 (mod .cse12 (+ .cse3 1)))))))) is different from true [2023-02-16 00:26:34,072 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 136 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:26:50,714 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:27:44,561 WARN L233 SmtUtils]: Spent 27.64s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:27:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:27:58,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:28:00,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-16 00:28:03,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:28:04,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-16 00:28:08,505 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse63 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse64 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse63))) (let ((.cse50 (select .cse3 .cse64)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse9)))) (.cse10 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (+ .cse9 .cse10)) (.cse24 (store .cse3 .cse64 1)) (.cse13 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse26 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse49 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse51 (not .cse4)) (.cse57 (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse25 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse63 8))) (and (or (= 0 (mod .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) .cse4) (or .cse4 (not (< 1 c_~N~0)) (< 2 c_~N~0) (= 0 (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (+ .cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10 .cse11))) (mod .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse5))) (store .cse7 .cse2 (+ (select .cse8 .cse2) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))) (or .cse13 (= 0 (let ((.cse23 (store .cse24 .cse25 1))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse15 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse18 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse19 .cse20))) (mod .cse14 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (store .cse16 .cse2 (+ (select .cse17 .cse2) (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))))) .cse26) (or (= 0 (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse33 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse28 (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33))))) (let ((.cse30 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse27 (+ .cse31 .cse32 .cse33 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse27 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse27))) (store .cse29 .cse2 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse30 .cse2))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))) (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (or .cse13 (= 0 (let ((.cse45 (store .cse3 .cse25 1))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse37 (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse42))))) (let ((.cse39 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse36 (+ .cse40 .cse41 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse42))) (mod .cse36 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| .cse36))) (store .cse38 .cse2 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse2))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))))) .cse26) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse4 (= 0 (let ((.cse46 (+ .cse50 .cse9 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse46 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse46))) (store .cse48 .cse2 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse49 .cse2))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or .cse51 (= 0 (let ((.cse56 (select .cse49 .cse25))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse9 .cse56))))) (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse52 (+ .cse50 .cse9 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse56))) (mod .cse52 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse52))) (store .cse54 .cse2 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse55 .cse2))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))) .cse57) (or .cse51 .cse57 (= 0 (let ((.cse62 (select .cse3 .cse25))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse62))))) (let ((.cse61 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse58 (+ .cse9 (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse62))) (mod .cse58 (+ (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse60 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| .cse58))) (store .cse60 .cse2 (+ (select .cse61 .cse2) (select (select (store .cse59 |c_ULTIMATE.start_main_~a~0#1.base| .cse60) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))))))))))) is different from true [2023-02-16 00:28:26,351 WARN L233 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:28:59,183 WARN L233 SmtUtils]: Spent 19.49s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:29:27,489 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)