./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/pcomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/pcomp.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 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:07:10,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:07:10,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:07:10,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:07:10,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:07:10,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:07:10,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:07:10,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:07:10,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:07:10,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:07:10,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:07:10,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:07:10,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:07:10,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:07:10,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:07:10,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:07:10,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:07:10,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:07:10,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:07:10,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:07:10,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:07:10,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:07:10,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:07:10,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:07:10,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:07:10,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:07:10,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:07:10,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:07:10,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:07:10,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:07:10,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:07:10,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:07:10,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:07:10,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:07:10,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:07:10,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:07:10,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:07:10,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:07:10,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:07:10,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:07:10,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:07:10,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:07:10,807 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:07:10,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:07:10,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:07:10,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:07:10,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:07:10,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:07:10,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:07:10,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:07:10,810 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:07:10,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:07:10,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:07:10,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:07:10,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:07:10,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:07:10,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:07:10,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:07:10,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:07:10,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:07:10,829 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:07:10,829 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 -> 1472da9c0a8f011e4f758f37d66a1227b497d4a96142a431b3f2f304a275b1b7 [2023-02-15 10:07:11,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:07:11,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:07:11,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:07:11,156 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:07:11,156 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:07:11,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcomp.c [2023-02-15 10:07:12,362 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:07:12,547 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:07:12,547 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcomp.c [2023-02-15 10:07:12,556 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f978749/96a46a75126243208b190a8c94115b14/FLAGa0d766368 [2023-02-15 10:07:12,572 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f978749/96a46a75126243208b190a8c94115b14 [2023-02-15 10:07:12,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:07:12,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:07:12,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:07:12,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:07:12,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:07:12,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d88ec1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12, skipping insertion in model container [2023-02-15 10:07:12,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:07:12,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:07:12,717 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/pcomp.c[588,601] [2023-02-15 10:07:12,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:07:12,739 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:07:12,747 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/pcomp.c[588,601] [2023-02-15 10:07:12,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:07:12,762 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:07:12,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12 WrapperNode [2023-02-15 10:07:12,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:07:12,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:07:12,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:07:12,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:07:12,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,790 INFO L138 Inliner]: procedures = 16, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-02-15 10:07:12,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:07:12,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:07:12,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:07:12,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:07:12,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,817 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:07:12,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:07:12,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:07:12,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:07:12,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (1/1) ... [2023-02-15 10:07:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:07:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:12,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:07:12,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:07:12,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:07:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:07:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:07:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:07:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:07:12,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:07:12,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:07:12,969 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:07:12,971 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:07:13,149 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:07:13,153 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:07:13,153 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:07:13,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:07:13 BoogieIcfgContainer [2023-02-15 10:07:13,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:07:13,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:07:13,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:07:13,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:07:13,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:07:12" (1/3) ... [2023-02-15 10:07:13,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552c343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:07:13, skipping insertion in model container [2023-02-15 10:07:13,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:12" (2/3) ... [2023-02-15 10:07:13,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552c343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:07:13, skipping insertion in model container [2023-02-15 10:07:13,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:07:13" (3/3) ... [2023-02-15 10:07:13,188 INFO L112 eAbstractionObserver]: Analyzing ICFG pcomp.c [2023-02-15 10:07:13,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:07:13,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:07:13,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:07:13,258 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;@1ec494ff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:07:13,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:07:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 10:07:13,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:13,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:13,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2023-02-15 10:07:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:13,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384029623] [2023-02-15 10:07:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:13,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:13,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384029623] [2023-02-15 10:07:13,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 10:07:13,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038484284] [2023-02-15 10:07:13,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:13,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:13,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:13,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:13,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:07:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:13,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 10:07:13,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:13,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:07:13,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038484284] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:13,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:13,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:07:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429977641] [2023-02-15 10:07:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:13,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:07:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:07:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:07:13,568 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:13,581 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-02-15 10:07:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:07:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2023-02-15 10:07:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:13,589 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:07:13,589 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 10:07:13,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:07:13,597 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:13,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:07:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 10:07:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 10:07:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-15 10:07:13,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2023-02-15 10:07:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:13,621 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-15 10:07:13,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-15 10:07:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 10:07:13,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:13,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:13,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:13,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 10:07:13,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2023-02-15 10:07:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:13,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111642012] [2023-02-15 10:07:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:13,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257569751] [2023-02-15 10:07:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:13,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:13,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:13,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:13,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:07:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:13,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 10:07:13,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:14,091 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-02-15 10:07:14,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-02-15 10:07:14,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:14,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:14,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:14,751 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 5 treesize of output 3 [2023-02-15 10:07:14,782 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:07:14,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:14,858 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 10:07:14,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 64 [2023-02-15 10:07:14,892 INFO L321 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2023-02-15 10:07:14,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 73 [2023-02-15 10:07:14,903 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 5 treesize of output 3 [2023-02-15 10:07:14,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:14,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 71 treesize of output 59 [2023-02-15 10:07:14,939 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 5 treesize of output 3 [2023-02-15 10:07:14,955 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-02-15 10:07:14,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 19 [2023-02-15 10:07:14,960 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 5 treesize of output 3 [2023-02-15 10:07:14,966 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:07:14,968 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 10:07:14,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 10:07:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:15,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:07:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:15,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111642012] [2023-02-15 10:07:15,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:15,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257569751] [2023-02-15 10:07:15,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257569751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:15,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:15,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:07:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73901091] [2023-02-15 10:07:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:15,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:07:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:07:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:07:15,008 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:15,065 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-15 10:07:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:07:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2023-02-15 10:07:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:15,067 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:07:15,067 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:07:15,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:07:15,068 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:15,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 65 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:07:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:07:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2023-02-15 10:07:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-15 10:07:15,074 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2023-02-15 10:07:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:15,074 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-15 10:07:15,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-15 10:07:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:07:15,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:15,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:15,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:15,280 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,SelfDestructingSolverStorable1 [2023-02-15 10:07:15,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1850906398, now seen corresponding path program 1 times [2023-02-15 10:07:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:15,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024388806] [2023-02-15 10:07:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:15,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:15,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577931218] [2023-02-15 10:07:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:15,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:15,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:07:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:15,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:07:15,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:15,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:07:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:15,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024388806] [2023-02-15 10:07:15,432 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:15,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577931218] [2023-02-15 10:07:15,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577931218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:15,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:15,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 10:07:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646997113] [2023-02-15 10:07:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:07:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:07:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:07:15,449 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-15 10:07:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:15,539 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2023-02-15 10:07:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:07:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-15 10:07:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:15,541 INFO L225 Difference]: With dead ends: 62 [2023-02-15 10:07:15,541 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 10:07:15,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:07:15,542 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:15,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 32 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 10:07:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2023-02-15 10:07:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-15 10:07:15,554 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2023-02-15 10:07:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:15,554 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-15 10:07:15,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-15 10:07:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-15 10:07:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:07:15,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:15,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:15,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 10:07:15,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:15,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2023-02-15 10:07:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:15,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891712626] [2023-02-15 10:07:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:15,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787327380] [2023-02-15 10:07:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:15,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:15,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:07:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:07:15,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:15,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891712626] [2023-02-15 10:07:15,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787327380] [2023-02-15 10:07:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787327380] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:15,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:15,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-02-15 10:07:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261510781] [2023-02-15 10:07:15,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:15,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:07:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:07:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:07:15,890 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:16,019 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2023-02-15 10:07:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:07:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-15 10:07:16,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:16,020 INFO L225 Difference]: With dead ends: 53 [2023-02-15 10:07:16,020 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 10:07:16,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:07:16,021 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:16,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 44 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 10:07:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-02-15 10:07:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-15 10:07:16,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2023-02-15 10:07:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:16,026 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-15 10:07:16,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-15 10:07:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 10:07:16,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:16,027 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:16,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:16,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:16,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1120615462, now seen corresponding path program 1 times [2023-02-15 10:07:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:16,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672550495] [2023-02-15 10:07:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:16,251 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:16,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059762130] [2023-02-15 10:07:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:16,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:16,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:16,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:16,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:07:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:16,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:07:16,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:16,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:07:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:16,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672550495] [2023-02-15 10:07:16,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:16,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059762130] [2023-02-15 10:07:16,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059762130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:16,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:16,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:07:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315707184] [2023-02-15 10:07:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:16,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:07:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:16,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:07:16,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:07:16,374 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:16,444 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2023-02-15 10:07:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:07:16,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2023-02-15 10:07:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:16,445 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:07:16,445 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:07:16,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:07:16,446 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:16,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 34 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:07:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:07:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2023-02-15 10:07:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-15 10:07:16,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2023-02-15 10:07:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:16,449 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-15 10:07:16,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-15 10:07:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:07:16,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:16,450 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] [2023-02-15 10:07:16,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 10:07:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:16,655 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2023-02-15 10:07:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:16,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154414938] [2023-02-15 10:07:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:16,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604546911] [2023-02-15 10:07:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:16,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:16,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:16,705 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:16,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:07:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:16,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 10:07:16,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:16,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 10:07:16,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:16,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:16,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 10:07:16,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2023-02-15 10:07:16,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:16,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:07:16,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:07:16,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:16,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 10:07:16,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 10:07:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:16,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:17,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) is different from false [2023-02-15 10:07:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 10:07:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:17,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154414938] [2023-02-15 10:07:17,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:17,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604546911] [2023-02-15 10:07:17,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604546911] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:17,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:17,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-15 10:07:17,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285275852] [2023-02-15 10:07:17,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:17,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:07:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:07:17,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=109, Unknown=11, NotChecked=22, Total=182 [2023-02-15 10:07:17,121 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:17,431 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2023-02-15 10:07:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:07:17,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 20 [2023-02-15 10:07:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:17,432 INFO L225 Difference]: With dead ends: 62 [2023-02-15 10:07:17,432 INFO L226 Difference]: Without dead ends: 60 [2023-02-15 10:07:17,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=278, Unknown=17, NotChecked=38, Total=462 [2023-02-15 10:07:17,433 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:17,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 96 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 110 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2023-02-15 10:07:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-15 10:07:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 30. [2023-02-15 10:07:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-15 10:07:17,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2023-02-15 10:07:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:17,438 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-15 10:07:17,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-15 10:07:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:07:17,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:17,439 INFO L195 NwaCegarLoop]: trace histogram [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-15 10:07:17,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:17,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:17,644 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2023-02-15 10:07:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:17,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760389874] [2023-02-15 10:07:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:17,675 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:17,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941769570] [2023-02-15 10:07:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:17,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:17,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:17,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:17,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:07:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:17,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 10:07:17,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:17,801 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:17,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 10:07:17,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:17,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 10:07:17,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:17,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:17,852 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:17,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 10:07:17,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:17,899 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:17,899 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 10:07:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:17,934 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:17,934 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 1 case distinctions, treesize of input 38 treesize of output 32 [2023-02-15 10:07:18,073 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:07:18,074 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 32 [2023-02-15 10:07:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:18,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760389874] [2023-02-15 10:07:20,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941769570] [2023-02-15 10:07:20,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941769570] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:20,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:20,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2023-02-15 10:07:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337816634] [2023-02-15 10:07:20,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:20,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:07:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:20,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:07:20,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=303, Unknown=8, NotChecked=0, Total=380 [2023-02-15 10:07:20,563 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:23,627 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2023-02-15 10:07:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 10:07:23,627 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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-15 10:07:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:23,628 INFO L225 Difference]: With dead ends: 90 [2023-02-15 10:07:23,628 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 10:07:23,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=352, Invalid=1279, Unknown=9, NotChecked=0, Total=1640 [2023-02-15 10:07:23,629 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 188 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:23,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 156 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 10:07:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 10:07:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2023-02-15 10:07:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-02-15 10:07:23,641 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 24 [2023-02-15 10:07:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:23,642 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-02-15 10:07:23,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-02-15 10:07:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:07:23,644 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:23,645 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] [2023-02-15 10:07:23,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 10:07:23,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:23,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1455292262, now seen corresponding path program 2 times [2023-02-15 10:07:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:23,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7518235] [2023-02-15 10:07:23,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:23,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:23,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459692808] [2023-02-15 10:07:23,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:07:23,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:23,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:23,873 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:23,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:07:23,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:07:23,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:23,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 10:07:23,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:07:23,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:07:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:24,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7518235] [2023-02-15 10:07:24,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:24,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459692808] [2023-02-15 10:07:24,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459692808] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:24,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:24,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 10:07:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836812676] [2023-02-15 10:07:24,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:24,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:07:24,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:07:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:07:24,047 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:24,300 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2023-02-15 10:07:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 10:07:24,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-15 10:07:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:24,301 INFO L225 Difference]: With dead ends: 154 [2023-02-15 10:07:24,301 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 10:07:24,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:07:24,303 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 107 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:24,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 80 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 10:07:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2023-02-15 10:07:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2023-02-15 10:07:24,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2023-02-15 10:07:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:24,317 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2023-02-15 10:07:24,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2023-02-15 10:07:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:07:24,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:24,318 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:24,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:24,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 10:07:24,524 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 628001548, now seen corresponding path program 2 times [2023-02-15 10:07:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:24,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059771174] [2023-02-15 10:07:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:24,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77105391] [2023-02-15 10:07:24,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:07:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:24,567 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:24,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:07:24,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:07:24,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:24,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:07:24,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:07:24,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:07:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:24,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059771174] [2023-02-15 10:07:24,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:07:24,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77105391] [2023-02-15 10:07:24,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77105391] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:24,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:07:24,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-15 10:07:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074536270] [2023-02-15 10:07:24,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:24,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:07:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:24,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:07:24,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:07:24,761 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-15 10:07:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:24,867 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-02-15 10:07:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:07:24,867 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 32 [2023-02-15 10:07:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:24,867 INFO L225 Difference]: With dead ends: 78 [2023-02-15 10:07:24,867 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 10:07:24,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:07:24,868 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:24,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 38 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 10:07:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2023-02-15 10:07:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2023-02-15 10:07:24,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 32 [2023-02-15 10:07:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:24,874 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2023-02-15 10:07:24,874 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-15 10:07:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2023-02-15 10:07:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:07:24,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:24,875 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:24,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 10:07:25,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:25,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 3 times [2023-02-15 10:07:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:25,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754825158] [2023-02-15 10:07:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:25,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:25,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:07:25,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187104616] [2023-02-15 10:07:25,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:07:25,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:25,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:25,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:07:25,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 10:07:25,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:26,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 10:07:26,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:26,022 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 10:07:26,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-02-15 10:07:26,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:26,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-02-15 10:07:26,101 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 10:07:26,160 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 10:07:26,198 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 10:07:26,278 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:26,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2023-02-15 10:07:26,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2023-02-15 10:07:26,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,336 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,336 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 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 10:07:26,371 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:07:26,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 64 [2023-02-15 10:07:26,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,386 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 10:07:26,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2023-02-15 10:07:26,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 12 [2023-02-15 10:07:26,592 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 10:07:26,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2023-02-15 10:07:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:26,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2023-02-15 10:07:26,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,692 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:26,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 44 [2023-02-15 10:07:26,749 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 10:07:26,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 81 [2023-02-15 10:07:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:26,762 INFO L321 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-02-15 10:07:26,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 115 [2023-02-15 10:07:26,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 12 [2023-02-15 10:07:37,570 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:07:37,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 132 [2023-02-15 10:07:37,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:37,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 97 treesize of output 85 [2023-02-15 10:07:37,583 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 74 treesize of output 64 [2023-02-15 10:07:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:07:37,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:39,851 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= 0 (select (store .cse0 (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|)) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (= (select (store .cse0 (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2 1) c_~N~0)))))) is different from false [2023-02-15 10:07:41,973 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse5 (* .cse9 8)) (.cse0 (<= .cse9 2147483647))) (and (or (not .cse0) (let ((.cse3 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0)) (= (select (store (store .cse2 .cse3 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse4 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4) c_~N~0)) (= (select (store (store .cse2 .cse3 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4 1) c_~N~0))))))) (or (let ((.cse6 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (= (select (store (store .cse2 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8) c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8 1) c_~N~0) (= (select (store (store .cse2 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)))))) .cse0)))) is different from false [2023-02-15 10:07:44,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse5 (<= .cse9 2147483647)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse4 (* .cse9 8))) (and (or (let ((.cse1 (+ .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store .cse0 .cse1 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2) c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0)) (= (select (store (store .cse0 .cse1 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1) c_~N~0)))))) (not .cse5)) (or .cse5 (let ((.cse6 (+ .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (= (select (store (store .cse0 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8) c_~N~0)) (= (select (store (store .cse0 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8 1) c_~N~0)))))))))) is different from false [2023-02-15 10:08:21,161 WARN L233 SmtUtils]: Spent 36.39s on a formula simplification. DAG size of input: 153 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:22,208 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse4 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) (+ (select .cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (.cse2 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store .cse1 .cse2 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store .cse1 .cse2 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1) c_~N~0)))))) is different from false [2023-02-15 10:08:30,193 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:40,271 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:49,102 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse21 (* .cse22 8)) (.cse9 (<= .cse22 2147483647))) (let ((.cse14 (not .cse9)) (.cse12 (+ .cse21 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse4 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (+ .cse21 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (= (select (store (store (let ((.cse3 (store (store .cse5 .cse6 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse3 .cse4))))) .cse7 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) .cse9) (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse11 (store (store .cse5 .cse12 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse11) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 .cse1 (+ (select .cse10 .cse2) (select .cse11 .cse4))))) .cse7 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse13) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse13 1) c_~N~0)))) .cse14) (or .cse14 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (= (select (store (store (let ((.cse16 (store (store .cse5 .cse12 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 .cse1 (+ (select .cse15 .cse2) (select .cse16 .cse4))))) .cse7 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0))))) (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse19 (store (store .cse5 .cse6 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse19) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse18 .cse1 (+ (select .cse18 .cse2) (select .cse19 .cse4))))) .cse7 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse20) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse20 1) c_~N~0)))) .cse9))))) is different from false [2023-02-15 10:08:51,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse0 (<= .cse22 2147483647)) (.cse21 (* .cse22 8))) (let ((.cse13 (+ .cse21 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse10 (not .cse0)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse6 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (+ .cse21 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1) c_~N~0) (= (select (store (store (let ((.cse5 (store (store .cse7 .cse8 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse4) (select .cse5 .cse6))))) .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0))))) (or .cse10 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse14 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse12 (store (store .cse7 .cse13 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 .cse3 (+ (select .cse12 .cse6) (select .cse11 .cse4))))) .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse14) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse14 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0))))) (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse16 (store (store .cse7 .cse13 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 .cse3 (+ (select .cse15 .cse4) (select .cse16 .cse6))))) .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17 1) c_~N~0)))) .cse10) (or .cse0 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse20 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse19 (store (store .cse7 .cse8 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse19) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse18 .cse3 (+ (select .cse19 .cse6) (select .cse18 .cse4))))) .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse20) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse20 1) c_~N~0))))))))) is different from false [2023-02-15 10:08:54,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse40 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse1 (<= .cse40 2147483647)) (.cse38 (* .cse40 8)) (.cse0 (<= .cse39 2147483647)) (.cse37 (* .cse39 8))) (let ((.cse10 (+ .cse37 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse30 (not .cse0)) (.cse15 (+ .cse38 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse12 (not .cse1)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse6 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse9 (+ .cse38 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse25 (+ .cse37 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (= (select (store (store (let ((.cse5 (store (store (store .cse8 .cse9 v_ArrVal_625) .cse10 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse3 .cse4 (+ (select .cse5 .cse6) (select .cse3 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2 1) c_~N~0))))) (or .cse12 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse16 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (= (select (store (store (let ((.cse14 (store (store (store .cse8 .cse15 v_ArrVal_625) .cse10 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 .cse4 (+ (select .cse14 .cse6) (select .cse13 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse16) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse16 1) c_~N~0))))))) (or .cse0 (and (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (v_ArrVal_625 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse17 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17) c_~N~0)) (= (select (store (store (let ((.cse19 (store (store (store .cse8 .cse15 v_ArrVal_625) .cse10 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse19) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse18 .cse4 (+ (select .cse19 .cse6) (select .cse18 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse17 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) .cse12) (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (v_ArrVal_625 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse22 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse21 (store (store (store .cse8 .cse9 v_ArrVal_625) .cse10 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse21) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse20 .cse4 (+ (select .cse21 .cse6) (select .cse20 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse22) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse22 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) .cse1))) (or (and (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse26 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse24 (store (store (store .cse8 .cse9 v_ArrVal_625) .cse25 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse24) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse23 .cse4 (+ (select .cse23 .cse7) (select .cse24 .cse6))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse26) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse26 1) c_~N~0)))) .cse1) (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse29 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse28 (store (store (store .cse8 .cse15 v_ArrVal_625) .cse25 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse27 .cse4 (+ (select .cse28 .cse6) (select .cse27 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse29) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse29 1) c_~N~0)))) .cse12)) .cse30) (or .cse30 (and (or (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse31 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse31) c_~N~0)) (= (select (store (store (let ((.cse33 (store (store (store .cse8 .cse15 v_ArrVal_625) .cse25 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse33) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse32 .cse4 (+ (select .cse32 .cse7) (select .cse33 .cse6))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse31 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) .cse12) (or .cse1 (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse34 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse34) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse34 1) c_~N~0) (= (select (store (store (let ((.cse36 (store (store (store .cse8 .cse9 v_ArrVal_625) .cse25 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse35 .cse4 (+ (select .cse36 .cse6) (select .cse35 .cse7))))) .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0))))))))))) is different from false [2023-02-15 10:08:57,420 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse4 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse3 (store (store (store .cse5 .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse3 .cse4))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) (forall ((v_ArrVal_630 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (let ((.cse11 (store (store (store .cse5 .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse11) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 .cse1 (+ (select .cse11 .cse4) (select .cse10 .cse2))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse12) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse12 1) c_~N~0)))))) is different from false [2023-02-15 10:08:57,629 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse4 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((v_ArrVal_630 Int) (v_ArrVal_624 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_624))) (let ((.cse3 (store (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse0 (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse3 .cse4)))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) (forall ((v_ArrVal_630 Int) (v_ArrVal_624 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10 1) c_~N~0) (= (select (store (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_624))) (let ((.cse12 (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 .cse1 (+ (select .cse12 .cse4) (select .cse11 .cse2)))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)))))) is different from false [2023-02-15 10:08:57,903 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|)) (.cse4 (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((v_ArrVal_630 Int) (v_ArrVal_624 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse9 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (= (select (store (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_624))) (let ((.cse3 (store (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_84| 4294967296)) (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse0 (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse2) (select .cse3 .cse4)))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (not (< |v_ULTIMATE.start_main_~i~0#1_84| c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse9 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) c_~N~0)))) (forall ((v_ArrVal_630 Int) (v_ArrVal_624 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_628 Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (v_ArrVal_625 Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< |v_ULTIMATE.start_main_~i~0#1_85| c_~N~0)) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10) c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) c_~N~0) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10 1) c_~N~0) (= (select (store (store (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_624))) (let ((.cse12 (store (store (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_625) .cse7 v_ArrVal_628) (+ (* (mod |v_ULTIMATE.start_main_~i~0#1_85| 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_630))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 .cse1 (+ (select .cse12 .cse4) (select .cse11 .cse2)))))) .cse8 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)))))) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) is different from false [2023-02-15 10:08:57,926 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:57,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:57,931 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:57,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:57,944 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 167 treesize of output 155 [2023-02-15 10:08:57,950 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 27 treesize of output 25 [2023-02-15 10:08:57,991 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:58,006 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 29 treesize of output 27 [2023-02-15 10:08:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 22 not checked. [2023-02-15 10:08:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754825158] [2023-02-15 10:08:58,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:08:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187104616] [2023-02-15 10:08:58,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187104616] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:58,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:08:58,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2023-02-15 10:08:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831224120] [2023-02-15 10:08:58,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:58,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 10:08:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 10:08:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=561, Unknown=20, NotChecked=610, Total=1406 [2023-02-15 10:08:58,069 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:09:00,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:09:24,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:09:33,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 10:09:43,466 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 157 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:45,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:09:56,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:10,894 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 61 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:10:15,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:17,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:19,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:21,504 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse14 (mod .cse15 4294967296))) (let ((.cse1 (< .cse15 c_~N~0)) (.cse6 (<= .cse14 2147483647)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse5 (* .cse14 8))) (and (or (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) .cse1) (or (let ((.cse2 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store .cse0 .cse2 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse4 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4) c_~N~0)) (= (select (store (store .cse0 .cse2 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4 1) c_~N~0)))))) (not .cse6)) (<= c_~N~0 2147483647) (or .cse1 (let ((.cse8 (store .cse0 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368))) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (.cse9 (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store .cse8 .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse10 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store .cse8 .cse9 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10) c_~N~0)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse10 1) c_~N~0))))))) (or .cse6 (let ((.cse11 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse12 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (= (select (store (store .cse0 .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse12) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse12 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse13 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse13) c_~N~0)) (= (select (store (store .cse0 .cse11 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse13 1) c_~N~0))))))))))) is different from false [2023-02-15 10:10:28,920 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse5 (* .cse9 8)) (.cse1 (<= .cse9 2147483647))) (and (or (= (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (or (not .cse1) (let ((.cse3 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2) c_~N~0)) (= (select (store (store .cse0 .cse3 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse4 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4) c_~N~0)) (= (select (store (store .cse0 .cse3 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4 1) c_~N~0))))))) (or (let ((.cse6 (+ .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)))) (and (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse7 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (>= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) (= (select (store (store .cse0 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset| (- 34359738368)) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7) c_~N~0)) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse7 1) c_~N~0)))) (forall ((|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_635 Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int) (v_ArrVal_633 Int)) (let ((.cse8 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (> 0 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (not (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8) c_~N~0)) (< (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse8 1) c_~N~0) (= (select (store (store .cse0 .cse6 v_ArrVal_633) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_635) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)))))) .cse1)))) is different from false [2023-02-15 10:10:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:34,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:36,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:38,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:40,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:42,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:43,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:50,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:12,422 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 110 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:11:14,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:16,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:17,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:23,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:25,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:27,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]