./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ss3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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/ss3.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 5805614faff907ef6adf6c59906ce41481de02c5b77e55fb631cc39640689370 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 00:15:25,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 00:15:25,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 00:15:25,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 00:15:25,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 00:15:25,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 00:15:25,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 00:15:25,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 00:15:25,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 00:15:25,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 00:15:25,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 00:15:25,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 00:15:25,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 00:15:25,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 00:15:25,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 00:15:25,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 00:15:25,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 00:15:25,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 00:15:25,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 00:15:25,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 00:15:25,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 00:15:25,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 00:15:25,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 00:15:25,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 00:15:25,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 00:15:25,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 00:15:25,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 00:15:25,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 00:15:25,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 00:15:25,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 00:15:25,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 00:15:25,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 00:15:25,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 00:15:25,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 00:15:25,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 00:15:25,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 00:15:25,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 00:15:25,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 00:15:25,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 00:15:25,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 00:15:25,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 00:15:25,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 00:15:25,726 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 00:15:25,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 00:15:25,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 00:15:25,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 00:15:25,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 00:15:25,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 00:15:25,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 00:15:25,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 00:15:25,728 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 00:15:25,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 00:15:25,728 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 00:15:25,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 00:15:25,729 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 00:15:25,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 00:15:25,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:15:25,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 00:15:25,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 00:15:25,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 00:15:25,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 00:15:25,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 00:15:25,731 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 00:15:25,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 00:15:25,732 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 00:15:25,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 00:15:25,732 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 00:15:25,732 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 -> 5805614faff907ef6adf6c59906ce41481de02c5b77e55fb631cc39640689370 [2023-02-17 00:15:25,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 00:15:25,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 00:15:25,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 00:15:25,936 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 00:15:25,936 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 00:15:25,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ss3.c [2023-02-17 00:15:27,022 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 00:15:27,241 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 00:15:27,242 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ss3.c [2023-02-17 00:15:27,247 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010394f7b/0dd0c3e08a5048a2a237e9acaafcfa64/FLAG347080580 [2023-02-17 00:15:27,263 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010394f7b/0dd0c3e08a5048a2a237e9acaafcfa64 [2023-02-17 00:15:27,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 00:15:27,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 00:15:27,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 00:15:27,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 00:15:27,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 00:15:27,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,275 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5c39b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27, skipping insertion in model container [2023-02-17 00:15:27,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 00:15:27,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 00:15:27,439 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/ss3.c[586,599] [2023-02-17 00:15:27,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:15:27,471 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 00:15:27,480 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/ss3.c[586,599] [2023-02-17 00:15:27,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 00:15:27,501 INFO L208 MainTranslator]: Completed translation [2023-02-17 00:15:27,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27 WrapperNode [2023-02-17 00:15:27,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 00:15:27,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 00:15:27,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 00:15:27,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 00:15:27,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,541 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-02-17 00:15:27,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 00:15:27,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 00:15:27,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 00:15:27,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 00:15:27,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 00:15:27,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 00:15:27,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 00:15:27,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 00:15:27,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (1/1) ... [2023-02-17 00:15:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 00:15:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:27,596 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-17 00:15:27,601 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-17 00:15:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 00:15:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 00:15:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 00:15:27,691 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 00:15:27,692 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 00:15:27,849 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 00:15:27,854 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 00:15:27,854 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 00:15:27,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:15:27 BoogieIcfgContainer [2023-02-17 00:15:27,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 00:15:27,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 00:15:27,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 00:15:27,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 00:15:27,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 12:15:27" (1/3) ... [2023-02-17 00:15:27,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698a1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:15:27, skipping insertion in model container [2023-02-17 00:15:27,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 12:15:27" (2/3) ... [2023-02-17 00:15:27,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5698a1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 12:15:27, skipping insertion in model container [2023-02-17 00:15:27,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 12:15:27" (3/3) ... [2023-02-17 00:15:27,862 INFO L112 eAbstractionObserver]: Analyzing ICFG ss3.c [2023-02-17 00:15:27,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 00:15:27,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 00:15:27,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 00:15:27,932 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;@5414e20e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 00:15:27,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 00:15:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:15:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 00:15:27,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:27,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:27,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2023-02-17 00:15:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933903224] [2023-02-17 00:15:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:28,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933903224] [2023-02-17 00:15:28,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 00:15:28,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665566945] [2023-02-17 00:15:28,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:28,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:28,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:28,058 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-17 00:15:28,083 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-17 00:15:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:28,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 00:15:28,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:28,165 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-17 00:15:28,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:15:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665566945] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:15:28,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:15:28,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 00:15:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39915864] [2023-02-17 00:15:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:15:28,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 00:15:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:28,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 00:15:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 00:15:28,207 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-17 00:15:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:28,224 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-17 00:15:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 00:15:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2023-02-17 00:15:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:28,232 INFO L225 Difference]: With dead ends: 50 [2023-02-17 00:15:28,232 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 00:15:28,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-17 00:15:28,239 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:28,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:15:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 00:15:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 00:15:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 00:15:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-17 00:15:28,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2023-02-17 00:15:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:28,264 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-17 00:15:28,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-17 00:15:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-17 00:15:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 00:15:28,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:28,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:28,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 00:15:28,467 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-17 00:15:28,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2023-02-17 00:15:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439430672] [2023-02-17 00:15:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:28,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439430672] [2023-02-17 00:15:28,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-17 00:15:28,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286084148] [2023-02-17 00:15:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:28,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:28,536 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-17 00:15:28,553 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-17 00:15:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:28,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 00:15:28,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:28,622 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-17 00:15:28,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 00:15:28,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286084148] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 00:15:28,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 00:15:28,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 00:15:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945045503] [2023-02-17 00:15:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 00:15:28,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 00:15:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 00:15:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:15:28,625 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-17 00:15:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:28,681 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-02-17 00:15:28,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 00:15:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-02-17 00:15:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:28,682 INFO L225 Difference]: With dead ends: 49 [2023-02-17 00:15:28,682 INFO L226 Difference]: Without dead ends: 33 [2023-02-17 00:15:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 00:15:28,683 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:28,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 00:15:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-17 00:15:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-02-17 00:15:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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-17 00:15:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-17 00:15:28,688 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2023-02-17 00:15:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:28,689 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-17 00:15:28,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-17 00:15:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-17 00:15:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 00:15:28,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:28,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:28,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 00:15:28,895 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-17 00:15:28,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2023-02-17 00:15:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:28,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361440984] [2023-02-17 00:15:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:28,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:28,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635627074] [2023-02-17 00:15:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:28,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:28,923 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-17 00:15:28,928 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-17 00:15:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 00:15:28,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-17 00:15:28,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:29,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 00:15:29,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 00:15:29,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 00:15:29,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-17 00:15:29,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 37 [2023-02-17 00:15:29,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 27 [2023-02-17 00:15:29,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 39 [2023-02-17 00:15:29,452 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 131 treesize of output 71 [2023-02-17 00:15:29,484 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-17 00:15:29,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:29,890 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:29,952 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-17 00:15:29,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:29,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361440984] [2023-02-17 00:15:29,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:29,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635627074] [2023-02-17 00:15:29,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635627074] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:29,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:29,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2023-02-17 00:15:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889706160] [2023-02-17 00:15:29,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:29,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 00:15:29,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 00:15:29,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2023-02-17 00:15:29,956 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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-17 00:15:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:32,181 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2023-02-17 00:15:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-17 00:15:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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 27 [2023-02-17 00:15:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:32,183 INFO L225 Difference]: With dead ends: 70 [2023-02-17 00:15:32,183 INFO L226 Difference]: Without dead ends: 60 [2023-02-17 00:15:32,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=514, Invalid=2456, Unknown=0, NotChecked=0, Total=2970 [2023-02-17 00:15:32,185 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 110 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:32,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 00:15:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-17 00:15:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2023-02-17 00:15:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 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-17 00:15:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-02-17 00:15:32,201 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 27 [2023-02-17 00:15:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:32,202 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-02-17 00:15:32,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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-17 00:15:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-02-17 00:15:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:15:32,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:32,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:32,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 00:15:32,409 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-17 00:15:32,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:32,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2023-02-17 00:15:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:32,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159713282] [2023-02-17 00:15:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:32,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712772204] [2023-02-17 00:15:32,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 00:15:32,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:32,439 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-17 00:15:32,441 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-17 00:15:32,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 00:15:32,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:32,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:15:32,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 00:15:32,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 00:15:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:32,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159713282] [2023-02-17 00:15:32,513 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:32,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712772204] [2023-02-17 00:15:32,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712772204] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:32,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:32,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 00:15:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877072958] [2023-02-17 00:15:32,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 00:15:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 00:15:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 00:15:32,515 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:15:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:32,617 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2023-02-17 00:15:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:15:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 29 [2023-02-17 00:15:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:32,618 INFO L225 Difference]: With dead ends: 109 [2023-02-17 00:15:32,618 INFO L226 Difference]: Without dead ends: 65 [2023-02-17 00:15:32,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-17 00:15:32,620 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:32,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:15:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-17 00:15:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2023-02-17 00:15:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 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-17 00:15:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-02-17 00:15:32,654 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2023-02-17 00:15:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:32,655 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-02-17 00:15:32,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:15:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-02-17 00:15:32,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 00:15:32,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:32,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:32,662 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-17 00:15:32,862 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-17 00:15:32,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2023-02-17 00:15:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:32,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290257437] [2023-02-17 00:15:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:32,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686699559] [2023-02-17 00:15:32,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 00:15:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:32,925 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-17 00:15:32,926 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-17 00:15:32,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 00:15:32,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:32,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 00:15:32,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 00:15:33,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 00:15:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:33,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290257437] [2023-02-17 00:15:33,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686699559] [2023-02-17 00:15:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686699559] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:33,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:33,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-02-17 00:15:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770129009] [2023-02-17 00:15:33,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:33,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 00:15:33,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:33,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 00:15:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 00:15:33,034 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:15:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 00:15:33,135 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2023-02-17 00:15:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 00:15:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 29 [2023-02-17 00:15:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 00:15:33,136 INFO L225 Difference]: With dead ends: 58 [2023-02-17 00:15:33,136 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 00:15:33,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-02-17 00:15:33,137 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 00:15:33,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 21 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 00:15:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 00:15:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-02-17 00:15:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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-17 00:15:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-02-17 00:15:33,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2023-02-17 00:15:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 00:15:33,144 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-02-17 00:15:33,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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-17 00:15:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-02-17 00:15:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 00:15:33,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 00:15:33,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 00:15:33,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 00:15:33,351 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-17 00:15:33,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 00:15:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 00:15:33,352 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2023-02-17 00:15:33,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 00:15:33,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145410018] [2023-02-17 00:15:33,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 00:15:33,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 00:15:33,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 00:15:33,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972094721] [2023-02-17 00:15:33,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 00:15:33,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 00:15:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 00:15:33,421 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-17 00:15:33,422 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-17 00:15:33,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 00:15:33,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 00:15:33,507 WARN L261 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-17 00:15:33,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 00:15:33,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 00:15:33,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 00:15:33,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 00:15:33,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:33,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2023-02-17 00:15:33,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:33,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2023-02-17 00:15:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 00:15:33,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:33,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2023-02-17 00:15:33,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:33,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-02-17 00:15:33,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-02-17 00:15:33,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:33,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2023-02-17 00:15:33,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2023-02-17 00:15:33,845 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 00:15:33,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2023-02-17 00:15:33,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2023-02-17 00:15:33,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 52 [2023-02-17 00:15:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:33,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 00:15:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 00:15:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 00:15:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145410018] [2023-02-17 00:15:43,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 00:15:43,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972094721] [2023-02-17 00:15:43,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972094721] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 00:15:43,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 00:15:43,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-02-17 00:15:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710961333] [2023-02-17 00:15:43,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 00:15:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-17 00:15:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 00:15:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-17 00:15:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2347, Unknown=0, NotChecked=0, Total=2652 [2023-02-17 00:15:43,749 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 52 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 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-17 00:15:45,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-02-17 00:16:36,394 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse38 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse40 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse78 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse58 (+ .cse39 (select .cse40 .cse78)))) (let ((.cse15 (+ 0 1)) (.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse58))) (.cse59 (< .cse14 c_~N~0)) (.cse28 (+ .cse14 1))) (let ((.cse12 (store .cse40 .cse78 1)) (.cse29 (< .cse28 c_~N~0)) (.cse30 (not .cse59)) (.cse57 (select .cse64 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (* c_~N~0 (+ c_~N~0 1))) (.cse3 (+ (* 8 .cse15) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0))) (.cse27 (+ (* .cse14 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (+ .cse15 1))) (and (forall ((~N~0 Int)) (or (= (let ((.cse5 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (+ (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 .cse8)))) (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse11)))))))) (let ((.cse7 (store (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse0 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 .cse8 .cse4))) (store .cse6 .cse3 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse2))))))) (* (+ ~N~0 1) ~N~0)) (< .cse13 ~N~0) (< .cse14 ~N~0) (not (< .cse15 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (< .cse13 ~N~0) (= (let ((.cse20 (let ((.cse26 (store .cse12 .cse27 1))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26))) (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse25 (+ (select .cse26 .cse8) (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse25))))))))) (let ((.cse22 (store (store (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse19 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse17 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse21 (store .cse22 .cse8 .cse19))) (store .cse21 .cse3 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse16 (+ (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse19))) (+ .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse16)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))))) (* (+ ~N~0 1) ~N~0)) (not (< .cse14 ~N~0)) (< .cse28 ~N~0) (not (< .cse15 ~N~0)))) (or .cse29 .cse30 (= (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 (select .cse40 .cse27)))))) (let ((.cse37 (store (store (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse34 (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse31 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse36 (store .cse37 .cse8 .cse34))) (store .cse36 .cse3 (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (+ .cse34 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse33)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse33))))))) .cse41)) (or (= (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse49 (+ .cse39 (select .cse40 .cse8)))) (+ .cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))) (let ((.cse48 (store (store (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse45 (+ 0 (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse48) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse42 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse47 (store .cse48 .cse8 .cse45))) (store .cse47 .cse3 (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| .cse47) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (+ (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse45))) (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse44))))))) .cse41) (< .cse13 c_~N~0) (not (< .cse15 c_~N~0))) (or .cse29 .cse30 (= (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse57 .cse27) .cse58))))) (let ((.cse56 (store (store (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse53 (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse51 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (store .cse56 .cse8 .cse53))) (store .cse55 .cse3 (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (+ (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse53))) (+ .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))))) .cse41)) (or .cse59 (= (let ((.cse66 (store (store .cse57 .cse8 0) .cse3 0))) (let ((.cse63 (+ 0 (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| .cse66) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse61 (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse65 (store .cse66 .cse8 .cse63))) (store .cse65 .cse3 (+ 0 (select (select (store .cse64 |c_ULTIMATE.start_main_~a~0#1.base| .cse65) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse62 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse60 (+ (select .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse63))) (+ .cse60 (select (select (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse62 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))))))) .cse41) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (forall ((~N~0 Int)) (or (= (let ((.cse71 (let ((.cse77 (store .cse40 .cse27 1))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse77))) (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse76 (+ (select .cse77 .cse8) (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse76)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse76))))))))) (let ((.cse73 (store (store (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse3 0))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse67 (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse72 (store .cse73 .cse8 .cse70))) (store .cse72 .cse3 (+ 0 (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse69 (+ .cse70 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse69))))))) (* (+ ~N~0 1) ~N~0)) (< .cse13 ~N~0) (not (< .cse14 ~N~0)) (< .cse28 ~N~0) (not (< .cse15 ~N~0)))))))))) is different from false [2023-02-17 00:18:53,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:25,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:27,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:28,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:36,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-17 00:19:40,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse84 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse65 (+ .cse20 (select .cse9 .cse84)))) (let ((.cse22 (+ 0 1)) (.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse65))) (.cse0 (< .cse34 c_~N~0)) (.cse47 (+ .cse34 1))) (let ((.cse33 (store .cse9 .cse84 1)) (.cse48 (< .cse47 c_~N~0)) (.cse49 (not .cse0)) (.cse64 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (* c_~N~0 (+ c_~N~0 1))) (.cse4 (+ (* 8 .cse22) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 0))) (.cse46 (+ (* .cse34 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (+ .cse22 1))) (and (or .cse0 (= (let ((.cse7 (store (store .cse9 .cse8 0) .cse4 0))) (let ((.cse5 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 .cse8 .cse5))) (store .cse6 .cse4 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (+ .cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) .cse10)) (or (= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (+ .cse20 (select .cse9 .cse8)))) (+ .cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (let ((.cse17 (store (store (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse14 (+ 0 (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse11 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (store .cse17 .cse8 .cse14))) (store .cse16 .cse4 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (+ (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse14))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse13))))))) .cse10) (< .cse21 c_~N~0) (not (< .cse22 c_~N~0)) .cse0) (forall ((~N~0 Int)) (or (= (let ((.cse27 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33))) (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse32 (+ (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse33 .cse8)))) (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse32)))))))) (let ((.cse29 (store (store (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse26 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse23 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (store .cse29 .cse8 .cse26))) (store .cse28 .cse4 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (+ (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse26))) (+ (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse25)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse25))))))) (* (+ ~N~0 1) ~N~0)) (< .cse21 ~N~0) (< .cse34 ~N~0) (not (< .cse22 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) (forall ((~N~0 Int)) (or (< .cse21 ~N~0) (= (let ((.cse39 (let ((.cse45 (store .cse33 .cse46 1))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45))) (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse44 (+ (select .cse45 .cse8) (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse44))))))))) (let ((.cse41 (store (store (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse38 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse36 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store .cse41 .cse8 .cse38))) (store .cse40 .cse4 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (+ (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse38))) (+ .cse35 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) (* (+ ~N~0 1) ~N~0)) (not (< .cse34 ~N~0)) (< .cse47 ~N~0) (not (< .cse22 ~N~0)))) (or .cse48 .cse49 (= (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 (select .cse9 .cse46)))))) (let ((.cse56 (store (store (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse53 (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse50 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (store .cse56 .cse8 .cse53))) (store .cse55 .cse4 (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (+ .cse53 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse52)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse52))))))) .cse10)) (or .cse48 .cse49 (= (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse64 .cse46) .cse65))))) (let ((.cse63 (store (store (select .cse61 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse60 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse63) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse58 (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse62 (store .cse63 .cse8 .cse60))) (store .cse62 .cse4 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)))))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (+ (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse60))) (+ .cse57 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse57)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4)))))))) .cse10)) (or .cse0 (= (let ((.cse72 (store (store .cse64 .cse8 0) .cse4 0))) (let ((.cse69 (+ 0 (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse67 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse71 (store .cse72 .cse8 .cse69))) (store .cse71 .cse4 (+ 0 (select (select (store .cse70 |c_ULTIMATE.start_main_~a~0#1.base| .cse71) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse66 (+ (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse69))) (+ .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse66)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) .cse10) (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (forall ((~N~0 Int)) (or (= (let ((.cse77 (let ((.cse83 (store .cse9 .cse46 1))) (let ((.cse80 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse83))) (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse81 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse82 (+ (select .cse83 .cse8) (select .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse81 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse82))))))))) (let ((.cse79 (store (store (select .cse77 |c_ULTIMATE.start_main_~a~0#1.base|) .cse8 0) .cse4 0))) (let ((.cse76 (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0))) (let ((.cse73 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse78 (store .cse79 .cse8 .cse76))) (store .cse78 .cse4 (+ 0 (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse78) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse74 (select .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse75 (+ .cse76 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (select (select (store .cse73 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse75)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse75))))))) (* (+ ~N~0 1) ~N~0)) (< .cse21 ~N~0) (not (< .cse34 ~N~0)) (< .cse47 ~N~0) (not (< .cse22 ~N~0)))))))))) is different from false [2023-02-17 00:19:44,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]