./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.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/loops-crafted-1/Mono1_1-2.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 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:22:03,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:22:03,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:22:03,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:22:03,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:22:03,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:22:03,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:22:03,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:22:03,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:22:03,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:22:03,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:22:03,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:22:03,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:22:03,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:22:03,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:22:03,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:22:03,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:22:03,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:22:03,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:22:03,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:22:03,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:22:03,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:22:03,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:22:03,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:22:03,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:22:03,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:22:03,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:22:03,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:22:03,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:22:03,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:22:03,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:22:03,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:22:03,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:22:03,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:22:03,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:22:03,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:22:03,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:22:03,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:22:03,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:22:03,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:22:03,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:22:03,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 00:22:03,425 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:22:03,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:22:03,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:22:03,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:22:03,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:22:03,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:22:03,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:22:03,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:22:03,427 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:22:03,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:22:03,427 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:22:03,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:22:03,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:22:03,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:22:03,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:22:03,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:22:03,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:22:03,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:22:03,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:22:03,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:22:03,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:22:03,430 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:22:03,431 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 -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2023-02-18 00:22:03,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:22:03,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:22:03,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:22:03,631 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:22:03,631 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:22:03,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2023-02-18 00:22:04,585 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:22:04,726 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:22:04,726 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2023-02-18 00:22:04,730 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c42ae188/74a1abfa8bee44978b09b638ed163caf/FLAG38b7665e3 [2023-02-18 00:22:04,739 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c42ae188/74a1abfa8bee44978b09b638ed163caf [2023-02-18 00:22:04,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:22:04,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:22:04,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:22:04,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:22:04,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:22:04,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29541b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04, skipping insertion in model container [2023-02-18 00:22:04,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:22:04,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:22:04,868 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/loops-crafted-1/Mono1_1-2.c[313,326] [2023-02-18 00:22:04,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:22:04,887 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:22:04,896 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/loops-crafted-1/Mono1_1-2.c[313,326] [2023-02-18 00:22:04,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:22:04,907 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:22:04,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04 WrapperNode [2023-02-18 00:22:04,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:22:04,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:22:04,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:22:04,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:22:04,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,928 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2023-02-18 00:22:04,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:22:04,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:22:04,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:22:04,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:22:04,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:22:04,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:22:04,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:22:04,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:22:04,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (1/1) ... [2023-02-18 00:22:04,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:22:04,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:04,986 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-18 00:22:05,017 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-18 00:22:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:22:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:22:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:22:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:22:05,070 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:22:05,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:22:05,157 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:22:05,164 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:22:05,164 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 00:22:05,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:22:05 BoogieIcfgContainer [2023-02-18 00:22:05,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:22:05,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:22:05,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:22:05,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:22:05,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:22:04" (1/3) ... [2023-02-18 00:22:05,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d551b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:22:05, skipping insertion in model container [2023-02-18 00:22:05,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:22:04" (2/3) ... [2023-02-18 00:22:05,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d551b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:22:05, skipping insertion in model container [2023-02-18 00:22:05,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:22:05" (3/3) ... [2023-02-18 00:22:05,171 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2023-02-18 00:22:05,182 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:22:05,182 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:22:05,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:22:05,225 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;@6f251a9b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:22:05,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:22:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-18 00:22:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 00:22:05,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:05,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 00:22:05,233 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2023-02-18 00:22:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:05,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642289816] [2023-02-18 00:22:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:05,339 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-18 00:22:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642289816] [2023-02-18 00:22:05,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642289816] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:22:05,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:22:05,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 00:22:05,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98219036] [2023-02-18 00:22:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:22:05,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 00:22:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:05,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 00:22:05,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:22:05,369 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 00:22:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:05,381 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2023-02-18 00:22:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 00:22:05,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-02-18 00:22:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:05,388 INFO L225 Difference]: With dead ends: 20 [2023-02-18 00:22:05,388 INFO L226 Difference]: Without dead ends: 8 [2023-02-18 00:22:05,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 00:22:05,394 INFO L413 NwaCegarLoop]: 13 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, 13 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-18 00:22:05,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:22:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-02-18 00:22:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-18 00:22:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-18 00:22:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-02-18 00:22:05,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-02-18 00:22:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:05,413 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-02-18 00:22:05,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-18 00:22:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-02-18 00:22:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 00:22:05,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:05,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 00:22:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:22:05,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2023-02-18 00:22:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:05,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518771104] [2023-02-18 00:22:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:05,500 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-18 00:22:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:05,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518771104] [2023-02-18 00:22:05,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518771104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:22:05,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:22:05,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 00:22:05,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322557332] [2023-02-18 00:22:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:22:05,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 00:22:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 00:22:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:22:05,503 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 00:22:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:05,540 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2023-02-18 00:22:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:22:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-02-18 00:22:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:05,541 INFO L225 Difference]: With dead ends: 16 [2023-02-18 00:22:05,541 INFO L226 Difference]: Without dead ends: 10 [2023-02-18 00:22:05,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:22:05,542 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:05,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:22:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-02-18 00:22:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-18 00:22:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-18 00:22:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-18 00:22:05,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-18 00:22:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:05,545 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-18 00:22:05,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-18 00:22:05,546 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-18 00:22:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:22:05,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:05,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:05,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 00:22:05,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:05,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2023-02-18 00:22:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:05,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367985140] [2023-02-18 00:22:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:05,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367985140] [2023-02-18 00:22:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367985140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129986746] [2023-02-18 00:22:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:05,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:05,628 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-18 00:22:05,661 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-18 00:22:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:05,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 00:22:05,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:05,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:05,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129986746] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:05,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:05,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-18 00:22:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610633689] [2023-02-18 00:22:05,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:05,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 00:22:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 00:22:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-18 00:22:05,740 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:05,777 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2023-02-18 00:22:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 00:22:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-18 00:22:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:05,778 INFO L225 Difference]: With dead ends: 20 [2023-02-18 00:22:05,778 INFO L226 Difference]: Without dead ends: 14 [2023-02-18 00:22:05,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-18 00:22:05,779 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:05,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:22:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-02-18 00:22:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-02-18 00:22:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-02-18 00:22:05,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-02-18 00:22:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:05,782 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-18 00:22:05,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-02-18 00:22:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 00:22:05,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:05,783 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:05,790 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-18 00:22:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:05,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2023-02-18 00:22:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:05,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614477844] [2023-02-18 00:22:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:06,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614477844] [2023-02-18 00:22:06,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614477844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100477156] [2023-02-18 00:22:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:06,105 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-18 00:22:06,120 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-18 00:22:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:06,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 00:22:06,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100477156] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:06,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:06,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2023-02-18 00:22:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677666570] [2023-02-18 00:22:06,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:06,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 00:22:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 00:22:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-02-18 00:22:06,222 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-18 00:22:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:06,301 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-18 00:22:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 00:22:06,302 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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 12 [2023-02-18 00:22:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:06,302 INFO L225 Difference]: With dead ends: 28 [2023-02-18 00:22:06,302 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 00:22:06,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:22:06,303 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:06,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:22:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 00:22:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-18 00:22:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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-18 00:22:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-02-18 00:22:06,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2023-02-18 00:22:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:06,307 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-02-18 00:22:06,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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-18 00:22:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-02-18 00:22:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 00:22:06,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:06,308 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:06,327 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-18 00:22:06,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-18 00:22:06,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2023-02-18 00:22:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:06,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793311505] [2023-02-18 00:22:06,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793311505] [2023-02-18 00:22:06,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793311505] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:06,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003767256] [2023-02-18 00:22:06,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:22:06,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:06,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:06,698 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-18 00:22:06,728 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-18 00:22:06,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:22:06,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:22:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 00:22:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:06,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003767256] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:06,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:06,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2023-02-18 00:22:06,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288619673] [2023-02-18 00:22:06,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 00:22:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 00:22:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-02-18 00:22:06,968 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:07,461 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2023-02-18 00:22:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 00:22:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-18 00:22:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:07,463 INFO L225 Difference]: With dead ends: 44 [2023-02-18 00:22:07,463 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 00:22:07,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=369, Unknown=0, NotChecked=0, Total=600 [2023-02-18 00:22:07,465 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:07,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 19 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:22:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 00:22:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-18 00:22:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2023-02-18 00:22:07,475 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2023-02-18 00:22:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:07,475 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2023-02-18 00:22:07,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2023-02-18 00:22:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 00:22:07,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:07,478 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:07,485 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-18 00:22:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:07,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2023-02-18 00:22:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536478310] [2023-02-18 00:22:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:07,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:07,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536478310] [2023-02-18 00:22:07,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536478310] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:07,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444865860] [2023-02-18 00:22:07,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:22:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:07,978 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-18 00:22:08,017 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-18 00:22:08,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 00:22:08,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:22:08,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 00:22:08,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-02-18 00:22:08,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-02-18 00:22:08,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444865860] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:08,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:08,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 6] total 23 [2023-02-18 00:22:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628047027] [2023-02-18 00:22:08,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:08,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 00:22:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 00:22:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-02-18 00:22:08,192 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:08,507 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2023-02-18 00:22:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 00:22:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-18 00:22:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:08,508 INFO L225 Difference]: With dead ends: 56 [2023-02-18 00:22:08,508 INFO L226 Difference]: Without dead ends: 47 [2023-02-18 00:22:08,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2023-02-18 00:22:08,509 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:08,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 00:22:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-18 00:22:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2023-02-18 00:22:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-02-18 00:22:08,515 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2023-02-18 00:22:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:08,515 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-02-18 00:22:08,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-02-18 00:22:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 00:22:08,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:08,517 INFO L195 NwaCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:08,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-18 00:22:08,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:08,721 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2023-02-18 00:22:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936503332] [2023-02-18 00:22:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 00:22:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:09,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936503332] [2023-02-18 00:22:09,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936503332] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:09,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454725471] [2023-02-18 00:22:09,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 00:22:09,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:09,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:09,041 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-18 00:22:09,044 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-18 00:22:09,075 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 00:22:09,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:22:09,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 00:22:09,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:09,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:09,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454725471] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:09,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:09,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 43 [2023-02-18 00:22:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588189855] [2023-02-18 00:22:09,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:09,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-18 00:22:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-18 00:22:09,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2023-02-18 00:22:09,850 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-18 00:22:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:24,749 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2023-02-18 00:22:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-18 00:22:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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 44 [2023-02-18 00:22:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:24,751 INFO L225 Difference]: With dead ends: 76 [2023-02-18 00:22:24,751 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 00:22:24,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 16 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=940, Invalid=1922, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 00:22:24,753 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:24,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-02-18 00:22:24,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 00:22:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-18 00:22:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 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-18 00:22:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2023-02-18 00:22:24,760 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2023-02-18 00:22:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:24,760 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2023-02-18 00:22:24,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-18 00:22:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2023-02-18 00:22:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 00:22:24,761 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:24,761 INFO L195 NwaCegarLoop]: trace histogram [28, 16, 12, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:24,768 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-18 00:22:24,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:24,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1269144285, now seen corresponding path program 5 times [2023-02-18 00:22:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:24,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204901392] [2023-02-18 00:22:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:24,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-18 00:22:25,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:25,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204901392] [2023-02-18 00:22:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204901392] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:25,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627243893] [2023-02-18 00:22:25,305 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 00:22:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:25,306 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-18 00:22:25,311 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-18 00:22:26,595 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2023-02-18 00:22:26,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:22:26,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 00:22:26,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-18 00:22:26,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-18 00:22:27,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627243893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:27,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:27,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2023-02-18 00:22:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370787077] [2023-02-18 00:22:27,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:27,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-18 00:22:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:27,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-18 00:22:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 00:22:27,362 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:35,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:22:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:22:44,814 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2023-02-18 00:22:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-18 00:22:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-02-18 00:22:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:22:44,817 INFO L225 Difference]: With dead ends: 128 [2023-02-18 00:22:44,817 INFO L226 Difference]: Without dead ends: 99 [2023-02-18 00:22:44,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1061, Invalid=1909, Unknown=0, NotChecked=0, Total=2970 [2023-02-18 00:22:44,819 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-18 00:22:44,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 32 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-02-18 00:22:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-18 00:22:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-02-18 00:22:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 states have internal predecessors, (111), 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-18 00:22:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-18 00:22:44,836 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 62 [2023-02-18 00:22:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:22:44,837 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-18 00:22:44,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:22:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-18 00:22:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-18 00:22:44,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:22:44,842 INFO L195 NwaCegarLoop]: trace histogram [46, 34, 12, 1, 1, 1, 1, 1, 1] [2023-02-18 00:22:44,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 00:22:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:45,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:22:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:22:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -905639277, now seen corresponding path program 6 times [2023-02-18 00:22:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:22:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644960593] [2023-02-18 00:22:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:22:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:22:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:22:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 805 proven. 1190 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-18 00:22:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:22:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644960593] [2023-02-18 00:22:45,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644960593] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:22:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874031388] [2023-02-18 00:22:45,903 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 00:22:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:22:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:22:45,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 00:22:45,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 00:22:51,754 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2023-02-18 00:22:51,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:22:51,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-18 00:22:51,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:22:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:52,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:22:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:22:56,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874031388] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:22:56,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:22:56,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 48, 49] total 96 [2023-02-18 00:22:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310372784] [2023-02-18 00:22:56,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:22:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-02-18 00:22:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:22:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-02-18 00:22:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2434, Invalid=6686, Unknown=0, NotChecked=0, Total=9120 [2023-02-18 00:22:56,526 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 96 states, 96 states have (on average 2.0416666666666665) internal successors, (196), 96 states have internal predecessors, (196), 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-18 00:22:59,579 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse39 10000000) (not (< .cse39 100000000)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000))))) is different from false [2023-02-18 00:23:51,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:23:54,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:23:56,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:23:58,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:00,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:02,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:05,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:07,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:09,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:11,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:13,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:14,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:16,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:18,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:20,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:23,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:25,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:28,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:30,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:32,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:34,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:36,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:38,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:40,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:42,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:44,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:46,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:48,180 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000))))) is different from false [2023-02-18 00:24:49,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:51,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:52,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:53,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:56,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:24:58,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:25:00,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:25:51,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:25:53,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:25:55,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:01,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:03,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:05,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:06,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:08,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:09,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:10,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:12,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:15,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:17,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:19,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:22,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:24,078 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000))))) is different from false [2023-02-18 00:27:26,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:28,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:29,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:31,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:32,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:34,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:36,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:38,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:40,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:27:42,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:28:49,333 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000))))) is different from false [2023-02-18 00:28:51,832 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000))))) is different from false [2023-02-18 00:28:55,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:28:57,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:28:59,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:01,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:03,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:05,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:07,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:09,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:11,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:12,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:14,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:16,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:18,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:20,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:22,602 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000))))) is different from false [2023-02-18 00:29:23,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:25,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:29:32,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:31:29,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:31:31,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:22,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:24,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:27,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:29,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:31,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:32:33,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:33:35,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:33:37,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:33:39,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:27,092 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse39 10000000) (not (< .cse39 100000000)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000))))) is different from false [2023-02-18 00:34:29,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:33,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:35,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:37,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:39,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:41,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:43,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:45,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:47,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:49,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:34:51,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:02,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:05,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:07,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:08,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:12,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:14,046 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000))))) is different from false [2023-02-18 00:36:16,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:18,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:36:20,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []